Skip to Main content Skip to Navigation
Conference papers

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

Abstract : 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 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.
Document type :
Conference papers
Complete list of metadata

Cited literature [7 references]  Display  Hide  Download

https://hal.inria.fr/inria-00359068
Contributor : Publications Loria <>
Submitted on : Thursday, February 5, 2009 - 2:52:36 PM
Last modification on : Wednesday, November 29, 2017 - 10:27:35 AM
Long-term archiving on: : Tuesday, June 8, 2010 - 9:55:45 PM

Files

borradaile_new.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00359068, version 1
  • ARXIV : 0902.1043

Collections

Citation

Glencora Borradaile, Erik D. Demaine, Siamak Tazari. Polynomial-Time Approximation Schemes for Subset-Connectivity Problems in Bounded-Genus Graphs. 26th International Symposium on Theoretical Aspects of Computer Science STACS 2009, Feb 2009, Freiburg, Germany. pp.171-182. ⟨inria-00359068⟩

Share

Metrics

Record views

385

Files downloads

318