A new approximation algorithm for the minimum 2-edge-connected spanning subgraph problem

被引：1

作者：

Civril, A. ^{[1
]}

机构：

[1] Atlas Univ, Comp Engineenng Dept, TR-34408 Istanbul, Turkey

来源：

THEORETICAL COMPUTER SCIENCE | 2023年 / 943卷

关键词：

Minimum 2-edge-connected spanning; subgraph problem; Approximation algorithms; Combinatorial optimization; 5/4-APPROXIMATION; TSP;

D O I：

10.1016/j.tcs.2022.12.013

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

We present a new approximation algorithm for the minimum 2-edge-connected spanning subgraph problem. Its approximation ratio is 43 , which matches the current best ratio. The approximation ratio of the algorithm is s on subcubic graphs, which is an improvement upon the previous best ratio of 54. 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.(c) 2022 Elsevier B.V. All rights reserved.

引用

页码：121 / 130

页数：10

共 50 条

[1] A new approximation algorithm for the minimum 2-edge-connected spanning subgraph problem (vol 943, 121, 2023)
Civril, A.
[J]. THEORETICAL COMPUTER SCIENCE, 2023, 963
[2] An approximation for finding a smallest 2-edge-connected subgraph containing a specified spanning tree
Nagamochi, H
[J]. DISCRETE APPLIED MATHEMATICS, 2003, 126 (01) : 83 - 113
[3] A better approximation ratio for the minimum k-edge-connected spanning subgraph problem
Fernandes, CG
[J]. PROCEEDINGS OF THE EIGHTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 1997, : 629 - 638
[4] A better approximation ratio for the minimum size k-edge-connected spanning subgraph problem
Fernandes, CG
[J]. JOURNAL OF ALGORITHMS-COGNITION INFORMATICS AND LOGIC, 1998, 28 (01): : 105 - 124
[5] A 4/3-Approximation Algorithm for the Minimum 2-Edge Connected Subgraph Problem
Hunkenschroeder, Christoph
Vempala, Santosh
Vetta, Adrian
[J]. ACM TRANSACTIONS ON ALGORITHMS, 2019, 15 (04)
[6] The 2-edge-connected subgraph polyhedron
Vandenbussche, D
Nemhauser, GL
[J]. JOURNAL OF COMBINATORIAL OPTIMIZATION, 2005, 9 (04) : 357 - 379
[7] A Simple Primal-Dual Approximation Algorithm for 2-Edge-Connected Spanning Subgraphs
Beyer, Stephan
Chimani, Markus
Spoerhase, Joachim
[J]. COMPUTING AND COMBINATORICS (COCOON 2020), 2020, 12273 : 347 - 359
[8] The 2-Edge-Connected Subgraph Polyhedron
Dieter Vandenbussche
George L. Nemhauser
[J]. Journal of Combinatorial Optimization, 2005, 9 : 357 - 379
[9] Minimum weight 2-edge-connected spanning subgraphs in planar graphs
Berger, Andre
Grigni, Michelangelo
[J]. AUTOMATA, LANGUAGES AND PROGRAMMING, PROCEEDINGS, 2007, 4596 : 90 - +
[10] Approximation algorithm for the minimum weight connected κ-subgraph cover problem
Zhang, Yaping
Shi, Yishuo
Zhang, Zhao
[J]. THEORETICAL COMPUTER SCIENCE, 2014, 535 : 54 - 58

← 1 2 3 4 5 →