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 条

[31] A 4-approximation algorithm for k-prize collecting Steiner tree problems
Matsuda, Yusa
Takahashi, Satoshi
[J]. OPTIMIZATION LETTERS, 2019, 13 (02) : 341 - 348
[32] A 4-approximation algorithm for k-prize collecting Steiner tree problems
Yusa Matsuda
Satoshi Takahashi
[J]. Optimization Letters, 2019, 13 : 341 - 348
[33] Ambivalent data structures for dynamic 2-edge-connectivity and k smallest spanning trees
Frederickson, GN
[J]. SIAM JOURNAL ON COMPUTING, 1997, 26 (02) : 484 - 538
[34] A 3/4-approximation algorithm for finding two disjoint Hamiltonian cycles of maximum weight
Ageev A.A.
Baburin A.E.
Gimadi E.Kh.
[J]. Journal of Applied and Industrial Mathematics, 2007, 1 (2) : 142 - 147
[35] A 2-approximation algorithm for the minimum weight edge dominating set problem
Fujito, T
Nagamochi, H
[J]. DISCRETE APPLIED MATHEMATICS, 2002, 118 (03) : 199 - 207
[36] Computation and algorithm for the minimum k-edge-connectivity of graphs
Yuefang Sun
Chenchen Wu
Xiaoyan Zhang
Zhao Zhang
[J]. Journal of Combinatorial Optimization, 2022, 44 : 1741 - 1752
[37] Computation and algorithm for the minimum k-edge-connectivity of graphs
Sun, Yuefang
Wu, Chenchen
Zhang, Xiaoyan
Zhang, Zhao
[J]. JOURNAL OF COMBINATORIAL OPTIMIZATION, 2022, 44 (03) : 1741 - 1752
[38] A 1.8 Approximation Algorithm for Augmenting Edge-Connectivity of a Graph from 1 to 2
Even, Guy
Feldman, Jon
Kortsarz, Guy
Nutov, Zeev
[J]. ACM TRANSACTIONS ON ALGORITHMS, 2009, 5 (02)
[39] An improved approximation algorithm for minimum size 2-edge connected spanning subgraphs
Cheriyan, J
Sebö, A
Szigeti, Z
[J]. INTEGER PROGRAMMING AND COMBINATORIAL OPTIMIZATION, 1998, 1412 : 126 - 136
[40] A new approximation algorithm for the minimum 2-edge-connected spanning subgraph problem
Civril, A.
[J]. THEORETICAL COMPUTER SCIENCE, 2023, 943 : 121 - 130

← 1 2 3 4 5 →