Nothing
pcSteiner: 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.
Getting started
Browse package contents
Package details |
|
|---|---|
| Author | Aleksei Krasikov <krasikov.as@phystech.edu> |
| Maintainer | Aleksei Krasikov <krasikov.as@phystech.edu> |
| License | GPL-3 |
| Version | 1.0.0.1 |
| URL | https://github.com/krashkov/pcSteiner |
| Package repository | View on CRAN |
| Installation |
Install the latest version of this package by entering the following in R:
|
Try the pcSteiner package in your browser
Any scripts or data that you put into this service are public.
