Polynomial-Time Approximation Schemes for Subset-Connectivity Problems in Bounded-Genus GraphsReport as inadecuate




Polynomial-Time Approximation Schemes for Subset-Connectivity Problems in Bounded-Genus Graphs - Download this document for free, or read online. Document in PDF available to download.

1 University of Waterloo Waterloo 2 MIT - Massachusetts Institute of Technology 3 TU Darmstadt - Technische Universität Darmstadt

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 On 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.

Keywords : polynomial-time approximation scheme bounded-genus graph embedded graph Steiner tree survivable-network design subset TSP





Author: Glencora Borradaile - Erik D. Demaine - Siamak Tazari -

Source: https://hal.archives-ouvertes.fr/



DOWNLOAD PDF




Related documents