Sciweavers

Share
FOCS
2009
IEEE

Approximating Minimum Cost Connectivity Problems via Uncrossable Bifamilies and Spider-Cover Decompositions

9 years 5 months ago
Approximating Minimum Cost Connectivity Problems via Uncrossable Bifamilies and Spider-Cover Decompositions
Abstract— We give approximation algorithms for the Generalized Steiner Network (GSN) problem. The input consists of a graph
Zeev Nutov
Added 20 May 2010
Updated 20 May 2010
Type Conference
Year 2009
Where FOCS
Authors Zeev Nutov
Comments (0)
books