Sciweavers

Share
STOC
2010
ACM
261views Algorithms» more  STOC 2010»
9 years 4 months ago
An Improved LP-based Approximation for Steiner Tree
The Steiner tree problem is one of the most fundamental ÆÈ-hard problems: given a weighted undirected graph and a subset of terminal nodes, find a minimum weight tree spanning ...
Jaroslaw Byrka, Fabrizio Grandoni, Thomas Rothvoss...
books