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 条
  • [21] Smallest 2-edge-connected graphs without a spanning trail
    Niu, Zhaohong
    Xiong, Liming
    Zhang, Shumin
    [J]. UTILITAS MATHEMATICA, 2012, 88 : 381 - 397
  • [22] Improving on the 1.5-approximation of a smallest 2-edge connected spanning subgraph
    Cheriyan, J
    Sebo, A
    Szigeti, Z
    [J]. SIAM JOURNAL ON DISCRETE MATHEMATICS, 2001, 14 (02) : 170 - 180
  • [23] AN O(log2 k)-APPROXIMATION ALGORITHM FOR THE k-VERTEX CONNECTED SPANNING SUBGRAPH PROBLEM
    Fakcharoenphol, Jittat
    Laekhanukit, Bundit
    [J]. SIAM JOURNAL ON COMPUTING, 2012, 41 (05) : 1095 - 1109
  • [24] An O(log2 k)-Approximation Algorithm for the k-Vertex Connected Spanning Subgraph Problem
    Fakcharoenphol, Jittat
    Laekhanukit, Bundit
    [J]. STOC'08: PROCEEDINGS OF THE 2008 ACM INTERNATIONAL SYMPOSIUM ON THEORY OF COMPUTING, 2008, : 153 - 158
  • [25] An Improved Approximation Algorithm for the Minimum Cost Subset k-Connected Subgraph Problem
    Bundit Laekhanukit
    [J]. Algorithmica, 2015, 72 : 714 - 733
  • [26] An Improved Approximation Algorithm for the Minimum Cost Subset k-Connected Subgraph Problem
    Laekhanukit, Bundit
    [J]. ALGORITHMICA, 2015, 72 (03) : 714 - 733
  • [27] TOWARD A 6/5 BOUND FOR THE MINIMUM COST 2-EDGE CONNECTED SPANNING SUBGRAPH
    Boyd, Sylvia
    Legault, Philippe
    [J]. SIAM JOURNAL ON DISCRETE MATHEMATICS, 2017, 31 (01) : 632 - 644
  • [28] A new bound for the 2-Edge Connected Subgraph Problem
    Carr, R
    Ravi, R
    [J]. INTEGER PROGRAMMING AND COMBINATORIAL OPTIMIZATION, 1998, 1412 : 112 - 125
  • [29] A linear time 5/3-approximation for the minimum 3 strongly-connected spanning subgraph problem
    Zhao, L
    Nagamochi, H
    Ibaraki, T
    [J]. INFORMATION PROCESSING LETTERS, 2003, 86 (02) : 63 - 70
  • [30] On the Connected Spanning Cubic Subgraph Problem
    Masse, Damien
    Euler, Reinhardt
    Lemarchand, Laurent
    [J]. CONVEXITY AND DISCRETE GEOMETRY INCLUDING GRAPH THEORY, 2016, 148 : 109 - 136
12345