Polynomial-Time Approximation Schemes for Subset-Connectivity Problems in Bounded-Genus Graphs
Name
Demaine_Polynomial-time.pdf
Size
271.51 KB
Format
Adobe PDF
Checksum (MD5)
c7ed5605f2eef685026b07bb5cdc22d9
Author(s)
Borradaile, Glencora
Demaine, Erik D.
Tazari, Siamak
Date Issued
June 2012
Journal
Algorithmica
Publisher
Springer-Verlag Berlin Heidelberg
Citation
Borradaile, Glencora, Erik D. Demaine, and Siamak Tazari. “Polynomial-Time Approximation Schemes for Subset-Connectivity Problems in Bounded-Genus Graphs.” Algorithmica 68, no. 2 (February 2014): 287–311. doi:10.1007/s00453-012-9662-2.
Version
Final published version
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(nlogn) time for graphs embedded on both orientable and nonorientable surfaces. This work generalizes the PTAS framework from planar graphs to bounded-genus graphs: any problem that is shown to be approximable by the planar PTAS framework of Borradaile et al. (ACM Trans. Algorithms 5(3), 2009) will also be approximable in bounded-genus graphs by our extension.
MIT Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Creative Commons Attribution-NonCommercial-No Derivative Works
Persistent DSpace Link
DOI of Published Version
http://stacs2009.informatik.uni-freiburg.de/proceedings_stacs09.pdf
