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

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(nlogn) time for graphs embedded on both orientab...

Full description

Bibliographic Details
Main Authors: Borradaile, Glencora (Author), Demaine, Erik D. (Contributor), Tazari, Siamak (Author)
Other Authors: Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory (Contributor), Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science (Contributor)
Format: Article
Language:English
Published: Springer-Verlag Berlin Heidelberg, 2014-05-16T14:36:54Z.
Subjects:
Article
Online Access:Get fulltext

Internet

Get fulltext

Similar Items