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

Author(s)
Borradaile, Glencora; Demaine, Erik D.; Tazari, Siamak
Thumbnail
DownloadDemaine_Polynomial-time.pdf (271.5Kb)
PUBLISHER_CC
Terms of use
Creative Commons Attribution-NonCommercial-No Derivative Works http://creativecommons.org/licenses/by-nc-nd/3.0/
Metadata
Show full item record
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.
Date issued
2012-06
URI
http://hdl.handle.net/1721.1/87025
Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory; Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
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
ISBN
978-3-939897-09-5
ISSN
0178-4617
1432-0541
Collections