Package: pcSteiner
Type: Package
Version: 1.0.0
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
Encoding: UTF-8
RoxygenNote: 7.1.1
Config/pak/sysreqs: libglpk-dev libxml2-dev
Repository: https://krashkov.r-universe.dev
Date/Publication: 2020-08-26 12:35:33 UTC
RemoteUrl: https://github.com/krashkov/pcsteiner
RemoteRef: HEAD
RemoteSha: b62b9901f5ac26a4c8c3f33a288a0685f971559d
NeedsCompilation: no
Packaged: 2026-09-21 06:58:36 UTC; root