Factor 4/3 Approximations for Minimum 2-Connected Subgraphs-Reference-Cited by-同舟云学术

Factor 4/3 Approximations for Minimum 2-Connected Subgraphs

Published:2000 Issue: Volume: Page:262-273
ISSN:0302-9743
Container-title:Approximation Algorithms for Combinatorial Optimization
language:
Short-container-title:

Author:

Vempala Santosh,Vetta Adrian

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-44436-X_26

Reference6 articles.

1. Carr, R., Ravi, R.: A new bound for the 2-edge connected subgraph problem. Proc 6th Annual International IPCO (1998)

2. Cheriyan, J., Sebö, A., Sigeti, Z.: Improving on the 1.5-approximation of a smallest 2-edge connected spanning subgraph. Proc 6th Annual International IPCO (1998)

3. N. Garg, A. Singla, S. Vempala, Improved approximations for biconnected subgraphs via better lower bounding techniques. Proc 6th Annual SODA (1993)

4. M. Grötschel, L. Lovász and A. Schrijver, Geometric algorithms and combinatorial optimization. Springer-Verlag, New York (1988)

5. D. Hartvigsen, Extensions of Matching Theory. Ph.D. thesis, GSIA, Carnegie Mellon University (1984)

Cited by 17 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. An Improved Approximation Algorithm for the Matching Augmentation Problem;SIAM Journal on Discrete Mathematics;2023-01-20

2. Approximation algorithms for minimum power k backbone node r-connected subgraph problem in wireless sensor networks;Discrete Mathematics, Algorithms and Applications;2019-12-30

3. A 4/3-Approximation Algorithm for the Minimum 2-Edge Connected Subgraph Problem;ACM Transactions on Algorithms;2019-10-12

4. Dual-Based Approximation Algorithms for Cut-Based Network Connectivity Problems;Algorithmica;2017-08-07

5. Computing the 2-blocks of directed graphs;RAIRO - Theoretical Informatics and Applications;2015-04