Package: pcSteiner 1.0.0
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.
Authors:
pcSteiner_1.0.0.tar.gz
pcSteiner_1.0.0.zip(r-4.5)pcSteiner_1.0.0.zip(r-4.4)pcSteiner_1.0.0.zip(r-4.3)
pcSteiner_1.0.0.tgz(r-4.5-any)pcSteiner_1.0.0.tgz(r-4.4-any)pcSteiner_1.0.0.tgz(r-4.3-any)
pcSteiner_1.0.0.tar.gz(r-4.5-noble)pcSteiner_1.0.0.tar.gz(r-4.4-noble)
pcSteiner_1.0.0.tgz(r-4.4-emscripten)pcSteiner_1.0.0.tgz(r-4.3-emscripten)
pcSteiner.pdf |pcSteiner.html✨
pcSteiner/json (API)
NEWS
| # Install 'pcSteiner' in R: |
| install.packages('pcSteiner', repos = c('https://krashkov.r-universe.dev', 'https://cloud.r-project.org')) |
Bug tracker:https://github.com/krashkov/pcsteiner/issues
graph-algorithmsr-languagesteiner-treesteiner-tree-problem
Last updated 5 years agofrom:b62b9901f5. Checks:9 OK. Indexed: yes.
| Target | Result | Latest binary |
|---|---|---|
| Doc / Vignettes | OK | Mar 24 2025 |
| R-4.5-win | OK | Mar 24 2025 |
| R-4.5-mac | OK | Mar 24 2025 |
| R-4.5-linux | OK | Mar 24 2025 |
| R-4.4-win | OK | Mar 24 2025 |
| R-4.4-mac | OK | Mar 24 2025 |
| R-4.4-linux | OK | Mar 24 2025 |
| R-4.3-win | OK | Mar 24 2025 |
| R-4.3-mac | OK | Mar 24 2025 |
Exports:pcs.tree
Dependencies:clicpp11glueigraphlatticelifecyclemagrittrMatrixpkgconfigrlangvctrs
Readme and manuals
Help Manual
| Help page | Topics |
|---|---|
| Solve the Prize-Collecting Steiner Tree problem | pcs.tree |
