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 条
  • [21] A 3-approximation for the minimum tree spanning k vertices
    Garg, N
    37TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 1996, : 302 - 309
  • [22] A 5/4-approximation algorithm for minimum 2-edge-connectivity
    Jothi, R
    Raghavachari, B
    Varadarajan, S
    PROCEEDINGS OF THE FOURTEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2003, : 725 - 734
  • [23] Generalized 3-connectivity and 3-edge-connectivity for the Cartesian products of some graph classes
    Sun, Yuefang
    Journal of Combinatorial Mathematics and Combinatorial Computing, 2015, 94 : 215 - 225
  • [24] A 4/3-approximation algorithm for the Maximum Internal Spanning Tree Problem
    Li, Xingfu
    Zhu, Daming
    Wang, Lusheng
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2021, 118 : 131 - 140
  • [25] The minimal size of a graph with given generalized 3-edge-connectivity
    Li, Xueliang
    Mao, Yaping
    ARS COMBINATORIA, 2015, 118 : 63 - 72
  • [26] A 3-approximation algorithm for the subtree distance between phylogenies
    Bordewich, Magnus
    McCartin, Catherine
    Semple, Charles
    JOURNAL OF DISCRETE ALGORITHMS, 2008, 6 (03) : 458 - 471
  • [27] A 3-Approximation Algorithm for Maximum Independent Set of Rectangles
    Galvez, Waldo
    Khan, Arindam
    Mari, Mathieu
    Momke, Tobias
    Pittu, Madhusudhan Reddy
    Wiese, Andreas
    PROCEEDINGS OF THE 2022 ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SODA, 2022, : 894 - 905
  • [28] A 5/3-Approximation Algorithm for Joint Replenishment with Deadlines
    Nonner, Tim
    Souza, Alexander
    COMBINATORIAL OPTIMIZATION AND APPLICATIONS, PROCEEDINGS, 2009, 5573 : 24 - 35
  • [29] A simple local 3-approximation algorithm for vertex cover
    Polishchuk, Valentin
    Suomela, Jukka
    INFORMATION PROCESSING LETTERS, 2009, 109 (12) : 642 - 645
  • [30] A 7/3-approximation for the minimum weight 3-connected spanning subgraph problem
    Nagamochi, H
    Seki, K
    Ibaraki, T
    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2000, E83A (04): : 687 - 691
12345