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.


Reference manual

It appears you don't have a PDF plugin for this browser. You can click here to download the reference manual.


1.0.0 by Aleksei Krasikov, a year ago

Report a bug at

Browse source code at

Authors: Aleksei Krasikov <[email protected]>

Documentation:   PDF Manual  

GPL-3 license

Imports stats

Depends on igraph

Suggests knitr, rmarkdown

See at CRAN