pcSteiner

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.

Last 30 days

This package has been downloaded 160 times in the last 30 days. Now we're getting somewhere! Enough downloads to populate a lively group chat. The following heatmap shows the distribution of downloads per day. Yesterday, it was downloaded 3 times.

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

Last 365 days

This package has been downloaded 2,419 times in the last 365 days. That's enough downloads to impress a room full of undergrads. A commendable achievement indeed. The day with the most downloads was Sep 11, 2024 with 31 downloads.

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