pcSteiner
Convenient Tool for Solving the Prize-Collecting Steiner Tree Problem
The Prize-Collecting Steiner Tree problem asks to find a subgraph connecting a given set of vertices with the most expensive nodes and least expensive edges. Since it is proven to be NP-hard, exact and efficient algorithm does not exist. This package provides convenient functionality for obtaining an approximate solution to this problem using loopy belief propagation algorithm.
Versions across snapshots
| Version | Repository | File | Size |
|---|---|---|---|
1.0.0.1 |
rolling linux/jammy R-4.5 | pcSteiner_1.0.0.1.tar.gz |
218.6 KiB |
1.0.0.1 |
rolling linux/noble R-4.5 | pcSteiner_1.0.0.1.tar.gz |
218.5 KiB |
1.0.0.1 |
rolling source/ R- | pcSteiner_1.0.0.1.tar.gz |
199.8 KiB |
1.0.0.1 |
latest linux/jammy R-4.5 | pcSteiner_1.0.0.1.tar.gz |
218.6 KiB |
1.0.0.1 |
latest linux/noble R-4.5 | pcSteiner_1.0.0.1.tar.gz |
218.5 KiB |
1.0.0.1 |
latest source/ R- | pcSteiner_1.0.0.1.tar.gz |
199.8 KiB |
1.0.0.1 |
2026-04-26 source/ R- | pcSteiner_1.0.0.1.tar.gz |
199.8 KiB |
1.0.0.1 |
2026-04-23 source/ R- | pcSteiner_1.0.0.1.tar.gz |
199.8 KiB |
1.0.0.1 |
2026-04-09 windows/windows R-4.5 | pcSteiner_1.0.0.1.zip |
220.2 KiB |
1.0.0.1 |
2025-04-20 source/ R- | pcSteiner_1.0.0.1.tar.gz |
199.8 KiB |