Sciweavers

SODA
2010
ACM
178views Algorithms» more  SODA 2010»
14 years 8 months ago
Tree Embeddings for Two-Edge-Connected Network Design
The group Steiner problem is a classical network design problem where we are given a graph and a collection of groups of vertices, and want to build a min-cost subgraph that conne...
Anupam Gupta, Ravishankar Krishnaswamy, R. Ravi