CRAN/E | pcSteiner

pcSteiner

Convenient Tool for Solving the Prize-Collecting Steiner Tree Problem

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

Version 1.0.0.1
R ≥ 3.1.0
Published 2022-05-23 865 days ago
Needs compilation? no
License GPL-3
CRAN checks pcSteiner results

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

Authors

Aleksei Krasikov

Material

README
NEWS
Reference manual
Package source

Vignettes

tutorial

macOS

r-release

arm64

r-oldrel

arm64

r-release

x86_64

r-oldrel

x86_64

Windows

r-devel

x86_64

r-release

x86_64

r-oldrel

x86_64

Old Sources

pcSteiner archive

Depends

R ≥ 3.1.0
igraph ≥ 0.6.0

Imports

stats

Suggests

knitr
rmarkdown