A 3/2-Approximation Algorithm for Augmenting the Edge-Connectivity of a Graph from 1 to 2 Using a Subset of a Given Edge Set-Reference-Cited by-同舟云学术

A 3/2-Approximation Algorithm for Augmenting the Edge-Connectivity of a Graph from 1 to 2 Using a Subset of a Given Edge Set

Published:2001 Issue: Volume: Page:90-101
ISSN:0302-9743
Container-title:Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques
language:
Short-container-title:

Author:

Even Guy,Feldman Jon,Kortsarz Guy,Nutov Zeev

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-44666-4_13

Reference14 articles.

1. R. Bar-Yehuda, “One for the Price of Two: A Unified Approach for Approximating Covering Problems”, Algorithmica 27(2), 2000, 131–144.

2. Lect Notes Comput Sci;J. Cheriyan,1999

3. Lect Notes Comput Sci;J. Cheriyan,1998

4. K. P. Eswaran and R. E. Tarjan, “Augmentation Problems”, SI AM J. Computing, 5 (1976), 653–665.

5. A. Frank, “Connectivity Augmentation Problems in Network Design”, Mathematical Programming, State of the Art, Ed. J. R. Birge and K. G. Murty, 1994, 34–63.

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

1. On the Tree Augmentation Problem;Algorithmica;2020-09-15

2. LP-relaxations for tree augmentation;Discrete Applied Mathematics;2018-04

3. Approximating (Unweighted) Tree Augmentation via Lift-and-Project, Part I: Stemless TAP;Algorithmica;2017-01-06

4. A Simplified 1.5-Approximation Algorithm for Augmenting Edge-Connectivity of a Graph from 1 to 2;ACM Transactions on Algorithms;2016-02-12

5. A 1.5-approximation algorithm for augmenting edge-connectivity of a graph from 1 to 2;Information Processing Letters;2011-02