The hardware and bandwidth for this mirror is donated by dogado GmbH, the Webhosting and Full Service-Cloud Provider. Check out our Wordpress Tutorial.
If you wish to report a bug, or if you are interested in having us mirror your free-software or open-source project, please feel free to contact us at mirror[@]dogado.de.
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.
| Version: | 1.0.0.1 |
| Depends: | R (≥ 3.1.0), igraph (≥ 0.6.0) |
| Imports: | stats |
| Suggests: | knitr, rmarkdown |
| Published: | 2022-05-23 |
| DOI: | 10.32614/CRAN.package.pcSteiner |
| Author: | Aleksei Krasikov |
| Maintainer: | Aleksei Krasikov <krasikov.as at phystech.edu> |
| BugReports: | https://github.com/krashkov/pcSteiner/issues |
| License: | GPL-3 |
| URL: | https://github.com/krashkov/pcSteiner |
| NeedsCompilation: | no |
| Materials: | README NEWS |
| CRAN checks: | pcSteiner results |
| Reference manual: | pcSteiner.pdf |
| Vignettes: |
tutorial |
| Package source: | pcSteiner_1.0.0.1.tar.gz |
| Windows binaries: | r-devel: pcSteiner_1.0.0.1.zip, r-release: pcSteiner_1.0.0.1.zip, r-oldrel: pcSteiner_1.0.0.1.zip |
| macOS binaries: | r-release (arm64): pcSteiner_1.0.0.1.tgz, r-oldrel (arm64): pcSteiner_1.0.0.1.tgz, r-release (x86_64): pcSteiner_1.0.0.1.tgz, r-oldrel (x86_64): pcSteiner_1.0.0.1.tgz |
| Old sources: | pcSteiner archive |
Please use the canonical form https://CRAN.R-project.org/package=pcSteiner to link to this page.
These binaries (installable software) and packages are in development.
They may not be fully stable and should be used with caution. We make no claims about them.
Health stats visible at Monitor.