Back to Search
Start Over
A new approximation algorithm for the minimum 2-edge-connected spanning subgraph problem.
- Source :
-
Theoretical Computer Science . Jan2023, Vol. 943, p121-130. 10p. - Publication Year :
- 2023
-
Abstract
- We present a new approximation algorithm for the minimum 2-edge-connected spanning subgraph problem. Its approximation ratio is 4 3 , which matches the current best ratio. The approximation ratio of the algorithm is 6 5 on subcubic graphs, which is an improvement upon the previous best ratio of 5 4. The algorithm is a novel extension of the primal-dual schema, which consists of two distinct phases. Both the algorithm and the analysis are much simpler than those of the previous approaches. [ABSTRACT FROM AUTHOR]
- Subjects :
- *APPROXIMATION algorithms
*COMBINATORIAL optimization
*ALGORITHMS
Subjects
Details
- Language :
- English
- ISSN :
- 03043975
- Volume :
- 943
- Database :
- Academic Search Index
- Journal :
- Theoretical Computer Science
- Publication Type :
- Academic Journal
- Accession number :
- 161080070
- Full Text :
- https://doi.org/10.1016/j.tcs.2022.12.013