Polynomial-Time Approximation Schemes for Subset-Connectivity Problems in Bounded-Genus Graphs - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2009

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

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.
Fichier principal
Vignette du fichier
borradaile_new.pdf (259.74 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00359068 , version 1 (05-02-2009)

Identifiers

  • HAL Id : inria-00359068 , version 1
  • ARXIV : 0902.1043

Cite

Glencora Borradaile, Erik D. Demaine, Siamak Tazari. Polynomial-Time Approximation Schemes for Subset-Connectivity Problems in Bounded-Genus Graphs. 26th International Symposium on Theoretical Aspects of Computer Science STACS 2009, Feb 2009, Freiburg, Germany. pp.171-182. ⟨inria-00359068⟩

Collections

STACS2009 TDS-MACS
278 View
108 Download

Altmetric

Share

Gmail Facebook X LinkedIn More