pcSteiner

Convenient Tool for Solving the Prize-Collecting Steiner Tree Problem

CRAN Package

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.

  • Version1.0.0.1
  • R versionunknown
  • LicenseGPL-3
  • Needs compilation?No
  • Last release05/23/2022

Documentation


Team


Insights

Last 30 days

Last 365 days

The following line graph shows the downloads per day. You can hover over the graph to see the exact number of downloads per day.

Data provided by CRAN


Binaries


Dependencies

  • Depends1 package
  • Suggests2 packages