Applications of the Linear Matroid Parity Algorithm to Approximating Steiner Trees (2008)
Piotr Berman, Martin Fürer Alex, Er Zelikovsky
The Steiner tree problem in unweighted graphs requires to find a minimum size connected subgraph containing a given subset of nodes (terminals). In this paper we investigate applications of the...