Package: pcSteiner
Type: Package
Version: 1.0.0.1
Date: 2020-08-21
Title: Convenient Tool for Solving the Prize-Collecting Steiner Tree
        Problem
Description: 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.
Author: Aleksei Krasikov <krasikov.as@phystech.edu>
Maintainer: Aleksei Krasikov <krasikov.as@phystech.edu>
URL: https://github.com/krashkov/pcSteiner
BugReports: https://github.com/krashkov/pcSteiner/issues
Depends: R (>= 3.1.0), igraph (>= 0.6.0)
Imports: stats
Suggests: knitr, rmarkdown
VignetteBuilder: knitr
License: GPL-3
Repository: CRAN
Encoding: UTF-8
RoxygenNote: 7.1.1
NeedsCompilation: no
Packaged: 2022-05-23 07:35:04 UTC; hornik
Date/Publication: 2022-05-23 08:02:24 UTC
Built: R 4.6.0; ; 2026-04-27 19:11:20 UTC; unix
