Work

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

Year: 2009

Type: preprint

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.

Source: arXiv (Cornell University)

DOI: 10.48550/arxiv.0902.1043

Authors: Borradaile, Glencora, Demaine, Erik D., Tazari, Siamak

Institutions: Oregon State University, Massachusetts Institute of Technology, MIT Computer Science and Artificial Intelligence Laboratory

Language: English

Topic: Complexity and Algorithms in Graphs

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W2949412477

Cites: 22

Cited by: 2

Related to: 20