A Simple Primal-Dual Approximation Algorithm for 2-Edge-Connected Spanning Subgraphs

@article{Beyer2020ASP,
  title={A Simple Primal-Dual Approximation Algorithm for 2-Edge-Connected Spanning Subgraphs},
  author={Stephan Beyer and Markus Chimani and Joachim Spoerhase},
  journal={ArXiv},
  year={2020},
  volume={abs/1808.04651}
}
We propose a simple and natural approximation algorithm for the problem of finding a 2-edge-connected spanning subgraph of minimum total edge cost in a graph. The algorithm maintains a spanning forest starting with an empty edge set. In each iteration, a new edge incident to a leaf is selected in a natural greedy manner and added to the forest. If this produces a cycle, this cycle is contracted. This growing phase ends when the graph has been contracted into a single node and a subsequent… 

References

SHOWING 1-10 OF 17 REFERENCES
Approximation Algorithms for Graph Augmentation
TLDR
The problem of increasing the connectivity1 of a graph at an optimal cost is studied, and an efficient approximation schemes that come within a constant factor from the optimal are focused on.
k-Edge-Connectivity: Approximation and LP Relaxation
TLDR
It is shown there is a constant e > 0 so that for all k > 1, finding a (1 + e)-approximation for k-ECSS is NP-hard, establishing a gap between the unit-cost and general-cost versions.
A Factor 2 Approximation Algorithm for the Generalized Steiner Network Problem
  • K. Jain
  • Mathematics, Computer Science
    Comb.
  • 2001
TLDR
A factor 2 approximation algorithm for finding a minimum-cost subgraph having at least a specified number of edges in each cut, which first solves the linear relaxation of the generalized Steiner network problem, and then iteratively rounds off the solution.
A general approximation technique for constrained forest problems
TLDR
The first approximation algorithms for many NP-complete problems, including the non-fixed point-to-point connection problem, the exact path partitioning problem and complex location-design problems are derived.
A primal-dual approximation algorithm for generalized steiner network problems
TLDR
The first polynomial-time approximation algorithm for finding a minimum-cost subgraph having at least a specified number of edges in each cut is presented, which shows the importance of this technique in designing approximation algorithms.
An efficient approximation algorithm for the survivable network design problem
TLDR
An improved version of the polynomial-time approximation algorithm for survivable network design problem (SNDP) is given that is more efficient and based on a combinatorial characterization of the “redundant” edges.
When cycles collapse: A general approximation technique for constrained two-connectivity problems
TLDR
The technique allows one to find nearly minimum-cost two-connected networks for a variety of connectivity requirements and extends to obtain approximation algorithms for augmenting a given network so as to satisfy certain communication requirements and achieve resilience to single-link failures.
Improved approximation algorithms for network design problems
TLDR
This paper presents an approximation algorithm with a performance guarantee of 2TH(fmax) = 2(1 + $ + g +) where fmax is the maximum requirement, and improves upon the best previously known performance guarantees of 2fmax.
A matroid approach to finding edge connectivity and packing arborescences
  • H. Gabow
  • Computer Science, Mathematics
    STOC '91
  • 1991
TLDR
An algorithm that finds k edge-disjoint arborescences on a directed graph in time O(kmn + k3n2)2 is presented, based on two theorems of Edmonds that link these two problems and show how they can be solved.
Efficient algorithms for finding minimum spanning trees in undirected and directed graphs
TLDR
This paper uses F-heaps to obtain fast algorithms for finding minimum spanning trees in undirected and directed graphs and can be extended to allow a degree constraint at one vertex.
...
1
2
...