Sciweavers

Share
OPODIS
2007

Distributed Approximation Algorithms for Finding 2-Edge-Connected Subgraphs

8 years 10 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 subgraph that, for each pair of vertices, contains at least two edge-disjoint paths connecting these vertices. The problem of finding a minimum weight 2-ECSS is NP-hard and a natural extension of the distributed MST construction problem, one of the most fundamental problems in the area of distributed computation. We present a distributed 3 2 -approximation algorithm for the unweighted 2-ECSS construction problem that requires O(n) communication rounds and O(m) messages. Moreover, we present a distributed 3-approximation algorithm for the weighted 2-ECSS construction problem that requires O(nlogn) communication rounds and O(nlog2 n+m) messages.
Sven Oliver Krumke, Peter Merz, Tim Nonner, Kathar
Added 30 Oct 2010
Updated 30 Oct 2010
Type Conference
Year 2007
Where OPODIS
Authors Sven Oliver Krumke, Peter Merz, Tim Nonner, Katharina Rupp
Comments (0)
books