Installation
About
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.
| github.com/krashkov/pcSteiner | |
| Bug report | File report |
Key Metrics
Downloads
| Yesterday | 10 0% |
| Last 7 days | 31 -48% |
| Last 30 days | 192 -27% |
| Last 90 days | 635 +8% |
| Last 365 days | 2.601 +16% |
Maintainer
| Maintainer | Aleksei Krasikov |