Sciweavers

3 search results - page 1 / 1
» Approximation schemes for minimum 2-edge-connected and bicon...
Sort
View
SODA
2004
ACM
152views Algorithms» more  SODA 2004»
13 years 7 months ago
Approximation schemes for minimum 2-edge-connected and biconnected subgraphs in planar graphs
Given an undirected graph, finding either a minimum 2-edge-connected spanning subgraph or a minimum 2vertex-connected (biconnected) spanning subgraph is MaxSNP-hard. We show that ...
Artur Czumaj, Michelangelo Grigni, Papa Sissokho, ...
ESA
2005
Springer
145views Algorithms» more  ESA 2005»
13 years 12 months ago
Approximation Schemes for Minimum 2-Connected Spanning Subgraphs in Weighted Planar Graphs
Abstract. We present new approximation schemes for various classical problems of finding the minimum-weight spanning subgraph in edge-weighted undirected planar graphs that are re...
André Berger, Artur Czumaj, Michelangelo Gr...
STOC
2006
ACM
186views Algorithms» more  STOC 2006»
14 years 6 months ago
A subset spanner for Planar graphs, : with application to subset TSP
Let > 0 be a constant. For any edge-weighted planar graph G and a subset S of nodes of G, there is a subgraph H of G of weight a constant times that of the minimum Steiner tree...
Philip N. Klein