Record Details
Polynomial-Time Approximation Schemes for Subset-Connectivity Problems in Bounded-Genus Graphs
ScholarsArchive at Oregon State University
| Field | Value |
|---|---|
| Title | Polynomial-Time Approximation Schemes for Subset-Connectivity Problems in Bounded-Genus Graphs |
| Names |
Borradaile, Glencora
(creator) Demaine, Erik D. (creator) Tazari, Siamak (creator) |
| Date Issued | 2014-02 (iso8601) |
| Note | This is an author's peer-reviewed final manuscript, as accepted by the publisher. The published article is copyrighted by Springer and can be found at: http://link.springer.com/journal/453. |
| 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 nonorientable surfaces. This work generalizes the PTAS frameworks of Borradaile, Klein, and Mathieu (2007) 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. |
| Genre | Article |
| Topic | Polynomial-time approximation scheme |
| Identifier | Borradaile, G., Demaine, E. D., & Tazari, S. (2014). Polynomial-time approximation schemes for subset-connectivity problems in bounded-genus graphs. Algorithmica, 68(2), 287-311. doi:10.1007/s00453-012-9662-2 |
