stoneTrees | R Documentation |
A package dedicated to finding minimum Steiner trees in networks. Particularly biological ones, which tend to be very sparse and on the easier end of the spectrum. This package is especially interested in Minimum Steiner Tree (MStT) and Maximum-Weight Connected Subgraph (MWCS) problems.
This package serves as a faithful implementation of "Thinning out Steiner Trees" (with a few bells and whistles added on the sides).
Adam Sardar
Fischetti M, Leitner M, Ljubić I, Luipersbeck M, Monaci M, Resch M, et al. Thinning out Steiner trees: a node-based model for uniform edge costs. Math Program Comput. dimacs11.cs.princeton.edu; 2017
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.