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 条
  • [1] A faster approximation algorithm for 2-edge-connectivity augmentation
    Galluccio, A
    Proietti, G
    [J]. ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2002, 2518 : 150 - 162
  • [2] Fast distributed approximation for TAP and 2-edge-connectivity
    Keren Censor-Hillel
    Michal Dory
    [J]. Distributed Computing, 2020, 33 : 145 - 168
  • [3] Fast distributed approximation for TAP and 2-edge-connectivity
    Censor-Hillel, Keren
    Dory, Michal
    [J]. DISTRIBUTED COMPUTING, 2020, 33 (02) : 145 - 168
  • [4] A (1+ln 2)-approximation algorithm for minimum-cost 2-edge-connectivity augmentation of trees with constant radius
    Cohen, Nachshon
    Nutov, Zeev
    [J]. THEORETICAL COMPUTER SCIENCE, 2013, 489 : 67 - 74
  • [5] A 4/3-approximation algorithm for minimum 3-edge-connectivity
    Gubbala, Prabhakar
    Raghavachari, Balaji
    [J]. ALGORITHMS AND DATA STRUCTURES, PROCEEDINGS, 2007, 4619 : 39 - +
  • [6] A 5/4-approximation algorithm for scheduling identical malleable tasks
    Decker, T.
    Luecking, T.
    Monien, B.
    [J]. THEORETICAL COMPUTER SCIENCE, 2006, 361 (2-3) : 226 - 240
  • [7] A 5/4-approximation algorithm for scheduling identical malleable tasks
    Decker, T
    Lücking, T
    Monien, B
    [J]. APPROXIMATION AND ONLINE ALGORITHMS, 2004, 2909 : 95 - 108
  • [8] A 5/4-approximation algorithm for biconnecting a graph with a given Hamiltonian path
    Bilò, D
    Proietti, G
    [J]. APPROXIMATION AND ONLINE ALGORITHMS, 2004, 3351 : 181 - 196
  • [9] An 5/4-Approximation Algorithm for Sorting Permutations by Short Block Moves
    Jiang, Haitao
    Feng, Haodi
    Zhu, Daming
    [J]. ALGORITHMS AND COMPUTATION, ISAAC 2014, 2014, 8889 : 491 - 503
  • [10] FULLY DYNAMIC 2-EDGE-CONNECTIVITY IN PLANAR GRAPHS
    HERSHBERGER, J
    RAUCH, M
    SURI, S
    [J]. LECTURE NOTES IN COMPUTER SCIENCE, 1992, 621 : 233 - 244
12345