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.

Version: 1.0.0
Depends: R (≥ 3.1.0), igraph (≥ 0.6.0)
Imports: stats
Suggests: knitr, rmarkdown
Published: 2020-08-31
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

Downloads:

Reference manual: pcSteiner.pdf
Vignettes: tutorial
Package source: pcSteiner_1.0.0.tar.gz
Windows binaries: r-devel: pcSteiner_1.0.0.zip, r-release: pcSteiner_1.0.0.zip, r-oldrel: pcSteiner_1.0.0.zip
macOS binaries: r-release: pcSteiner_1.0.0.tgz, r-oldrel: pcSteiner_1.0.0.tgz

Linking:

Please use the canonical form https://CRAN.R-project.org/package=pcSteiner to link to this page.