A 5/4-approximation algorithm for minimum 2-edge-connectivity

被引：0
|
作者：
Jothi, R [1 ]
Raghavachari, B [1 ]
Varadarajan, S [1 ]
机构：
[1] Univ Texas, Dept Comp Sci, Richardson, TX 75080 USA
来源：
PROCEEDINGS OF THE FOURTEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS | 2003年
关键词：
D O I：
暂无
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
A 5/4-approximation algorithm is presented for the minimum cardinality 2-edge-connected spanning sub-graph problem in undirected graphs. This improves the previous best approximation ratio of 4/3. It is shown that our ratio is tight with respect to current lower bounds, and any further improvement is possible only if new lower bounds are discovered.
引用
收藏
页码：725 / 734
页数：10
相关论文
共 50 条
  • [21] A 4-Approximation of the 2π/3-MST
    Ashur, Stav
    Katz, Matthew J.
    [J]. ALGORITHMS AND DATA STRUCTURES, WADS 2021, 2021, 12808 : 129 - 143
  • [22] A 4-approximation of the 2Π/3-MST
    Ashur, Stav
    Katz, Matthew J.
    [J]. COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2023, 108
  • [23] Approximating the Smallest Spanning Subgraph for 2-Edge-Connectivity in Directed Graphs
    Georgiadis, Loukas
    Italiano, Giuseppe F.
    Papadopoulos, Charis
    Parotsidis, Nikos
    [J]. ALGORITHMS - ESA 2015, 2015, 9294 : 582 - 594
  • [24] A Fast 4-Approximation Algorithm for the Traveling Repairman Problem on a Line
    Perez Perez, S. L.
    Urban Riverol, L. E.
    Lopez Bracho, R.
    Zaragoza Martinez, F. J.
    [J]. 2014 11TH INTERNATIONAL CONFERENCE ON ELECTRICAL ENGINEERING, COMPUTING SCIENCE AND AUTOMATIC CONTROL (CCE), 2014,
  • [25] A static 2-approximation algorithm for vertex connectivity and incremental approximation algorithms for edge and vertex connectivity
    Henzinger, MR
    [J]. JOURNAL OF ALGORITHMS, 1997, 24 (01) : 194 - 220
  • [26] 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)
  • [27] A 3/4-approximation algorithm for maximum ATSP with weights zero and one
    Bläser, M
    [J]. APPROXIMATION, RANDOMIZATION, AND COMBINATORIAL OPTIMIZATION: ALGORITHMS AND TECHNIQUES, PROCEEDINGS, 2004, 3122 : 61 - 71
  • [28] A 5/4-approximation for subcubic 2EC using circulations and obliged edges
    Boyd, Sylvia
    Fu, Yao
    Sun, Yu
    [J]. DISCRETE APPLIED MATHEMATICS, 2016, 209 : 48 - 58
  • [29] Incremental Algorithm for Minimum Cut and Edge Connectivity in Hypergraph
    Gupta, Rahul Raj
    Karmakar, Sushanta
    [J]. COMBINATORIAL ALGORITHMS, IWOCA 2019, 2019, 11638 : 237 - 250
  • [30] A 4-approximation algorithm for the TSP-Path satisfying a biased triangle inequality
    Mohan, Usha
    Ramani, Sivaramakrishnan
    Mishra, Sounaka
    [J]. DISCRETE APPLIED MATHEMATICS, 2019, 271 : 108 - 118
12345