A 4/3-approximation algorithm for minimum 3-edge-connectivity

被引：0
|
作者：
Gubbala, Prabhakar [1 ]
Raghavachari, Balaji [2 ]
机构：
[1] Microsoft Corp, Redmond, WA 98052 USA
[2] Univ Texas Dallas, Comp Sci Dept, Richardson, TX 75083 USA
来源：
ALGORITHMS AND DATA STRUCTURES, PROCEEDINGS | 2007年 / 4619卷
关键词：
approximation algorithms; graph and network algorithms; connectivity; combinatorial optimization;
D O I：
暂无
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
The minimum cardinality 3-edge-connected spanning sub-graph problem is considered. An approximation algorithm with a performance ratio of 4/3 approximate to 1.33 is presented. This improves the previous best ratio of 3/2 for the problem. The algorithm also works on multigraphs and guarantees the same approximation ratio.
引用
收藏
页码：39 / +
页数：3
相关论文
共 50 条
  • [1] A 4/3-Approximation Algorithm for the Minimum 2-Edge Connected Subgraph Problem
    Hunkenschroeder, Christoph
    Vempala, Santosh
    Vetta, Adrian
    ACM TRANSACTIONS ON ALGORITHMS, 2019, 15 (04)
  • [2] A simple certifying algorithm for 3-edge-connectivity
    Tsin, Yung H.
    THEORETICAL COMPUTER SCIENCE, 2023, 951
  • [3] An efficient distributed algorithm for 3-edge-connectivity
    Tsin, Yung H.
    INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2006, 17 (03) : 677 - 701
  • [4] A self-stabilizing algorithm for 3-edge-connectivity
    Saifullah, Abusayeed M.
    Tsin, Yung H.
    PARALLEL AND DISTRIBUTED PROCESSING AND APPLICATIONS, PROCEEDINGS, 2007, 4742 : 6 - 19
  • [5] Certifying 3-Edge-Connectivity
    Kurt Mehlhorn
    Adrian Neumann
    Jens M. Schmidt
    Algorithmica, 2017, 77 : 309 - 335
  • [6] Certifying 3-Edge-Connectivity
    Mehlhorn, Kurt
    Neumann, Adrian
    Schmidt, Jens M.
    GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, WG 2013, 2013, 8165 : 358 - 369
  • [7] Yet another optimal algorithm for 3-edge-connectivity
    Tsin, Yung H.
    JOURNAL OF DISCRETE ALGORITHMS, 2009, 7 (01) : 130 - 146
  • [8] Certifying 3-Edge-Connectivity
    Mehlhorn, Kurt
    Neumann, Adrian
    Schmidt, Jens M.
    ALGORITHMICA, 2017, 77 (02) : 309 - 335
  • [9] Group connectivity under 3-edge-connectivity
    Han, Miaomiao
    Li, Jiaao
    Li, Xueliang
    Wang, Meiling
    JOURNAL OF GRAPH THEORY, 2021, 96 (03) : 438 - 450
  • [10] A local search 4/3-approximation algorithm for the minimum 3-path partition problem
    Chen, Yong
    Goebel, Randy
    Lin, Guohui
    Liu, Longcheng
    Su, Bing
    Tong, Weitian
    Xu, Yao
    Zhang, An
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2022, 44 (05) : 3595 - 3610
12345