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

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

2009-02-06

arxiv.org/abs/0902.1043v2

26th International Symposium on Theoretical Aspects of Computer Science STACS 2009 (2009) 171-182

Computer Science

Discrete Mathematics

Updated version from the conference (STACS) version

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Polynomial-Time Approximation Schemes for Subset-Connectivity Problems in Bounded-Genus Graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Polynomial-Time Approximation Schemes for Subset-Connectivity Problems in Bounded-Genus Graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Polynomial-Time Approximation Schemes for Subset-Connectivity Problems in Bounded-Genus Graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-251553