Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

9

FOCS
2009
IEEE

favoriteEmaildiscussreport

163views Theoretical Computer Science» more FOCS 2009»

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

13 years 11 months ago

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

Download www.openu.ac.il

Abstract— We give approximation algorithms for the Generalized Steiner Network (GSN) problem. The input consists of a graph

Zeev Nutov

Real-time Traffic

Approximation Algorithms | FOCS 2009 | Steiner Network | Subset | Theoretical Computer Science |

claim paper

Post Info
More Details (n/a)

Added	20 May 2010
Updated	20 May 2010
Type	Conference
Year	2009
Where	FOCS
Authors	Zeev Nutov

Comments (0)