Sciweavers

17 search results - page 1 / 4
» Approximation Schemes for Minimum 2-Connected Spanning Subgr...
Sort
View
ESA
2005
Springer
145views Algorithms» more  ESA 2005»
13 years 9 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...
SODA
2004
ACM
152views Algorithms» more  SODA 2004»
13 years 5 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, ...
STOC
2006
ACM
186views Algorithms» more  STOC 2006»
14 years 4 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
ICALP
2001
Springer
13 years 8 months ago
Approximating the Minimum Spanning Tree Weight in Sublinear Time
We present a probabilistic algorithm that, given a connected graph G (represented by adjacency lists) of average degree d, with edge weights in the set {1, . . . , w}, and given a ...
Bernard Chazelle, Ronitt Rubinfeld, Luca Trevisan
OPODIS
2007
13 years 5 months ago
Distributed Approximation Algorithms for Finding 2-Edge-Connected Subgraphs
Abstract. We consider the distributed construction of a minimum weight 2edge-connected spanning subgraph (2-ECSS) of a given weighted or unweighted graph. A 2-ECSS of a graph is a ...
Sven Oliver Krumke, Peter Merz, Tim Nonner, Kathar...