A (1 + ln 2)-Approximation Algorithm for Minimum-Cost 2-Edge-Connectivity Augmentation of Trees with Constant Radius-Reference-Cited by-同舟云学术

A (1 + ln 2)-Approximation Algorithm for Minimum-Cost 2-Edge-Connectivity Augmentation of Trees with Constant Radius

Published:2011 Issue: Volume: Page:147-157
ISSN:0302-9743
Container-title:Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
language:
Short-container-title:

Author:

Cohen Nachshon,Nutov Zeev

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-22935-0_13

Reference12 articles.

1. Lecture Notes in Computer Science;J. Cheriyan,1999

2. Cheriyan, J., Karloff, H., Khandekar, R., Könemann, J.: On the integrality ratio for tree augmentation. Operations Research Letters 36(4), 399–401 (2008)

3. Even, G., Kortsarz, G., Nutov, Z.: A 1.5 approximation algorithm for augmenting edge-connectivity of a graph from 1 to 2. Information Processing Letters 111(6), 296–300 (2011)

4. Fredrickson, G.N., Jájá, J.: On the relationship between the biconnectivity augmentation and traveling salesman problem. Theorethical Computer Science 19(2), 189–201 (1982)

5. Goemans, M., Williamson, D.: The primal dual method for approximation algorithms and its applications to network design problems. In: Hochbaum, D.S. (ed.) Approximation Algorithms for NP-hard Problems, ch. 4, pp. 144–191. PWS (1995)

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

1. On the Cycle Augmentation Problem: Hardness and Approximation Algorithms;Approximation and Online Algorithms;2020

2. Approximate Min-Power Strong Connectivity;SIAM Journal on Discrete Mathematics;2013-01