Sciweavers

Share
STACS
2009
Springer

Polynomial-Time Approximation Schemes for Subset-Connectivity Problems in Bounded-Genus Graphs

10 years 9 months ago
Polynomial-Time Approximation Schemes for Subset-Connectivity Problems in Bounded-Genus Graphs
We present the first polynomial-time approximation schemes (PTASes) for the following subset-connectivity problems in edge-weighted graphs of bounded genus: Steiner tree, low-connectivity survivable-network design, and subset TSP. The schemes run in O(n log n) time for graphs embedded on both orientable and non-orientable surfaces. This work generalizes the PTAS frameworks of Borradaile, Klein, and Mathieu [BMK07, Kle06] from planar graphs to bounded-genus graphs: any future problems shown to admit the required structure theorem for planar graphs will similarly extend to bounded-genus graphs.
Glencora Borradaile, Erik D. Demaine, Siamak Tazar
Added 20 May 2010
Updated 20 May 2010
Type Conference
Year 2009
Where STACS
Authors Glencora Borradaile, Erik D. Demaine, Siamak Tazari
Comments (0)
books