Inapproximability of survivable networks

Theoretical Computer Science

Volumn 410, Issue 21-23, 2009, Pages 2122-2125

  Lando, Yuval ^a   Nutov, Zeev ^b  

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

^b OPEN UNIVERSITY OF ISRAEL   (Israel)

Author keywords

Directed Steiner tree; Hardness of approximation; k Connected Subgraph; Survivable Network Design Problem

Indexed keywords

APPROXIMATION RATIOS; DIRECTED STEINER TREE; HARDNESS OF APPROXIMATION; INAPPROXIMABILITY; K-CONNECTED SUBGRAPH; MINIMUM COSTS; NETWORK DESIGN PROBLEMS; NODE CONNECTIVITIES; SURVIVABLE NETWORK DESIGN PROBLEM; SURVIVABLE NETWORKS; VERTEX CONNECTIVITIES;

DESIGN; HARDNESS; MASS TRANSPORTATION;

TREES (MATHEMATICS);

EID: 64249115316     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2009.01.036     Document Type: Article

References (16)

1. T. Chakraborty, J. Chuzhoy, S. Khanna, Network design for vertex connectivity, in: STOC, 2008, pp. 167-176
2. Charikar M., Chekuri C., Cheung T., Dai Z., Goel A., Guha S., and Li M. Approximation algorithms for directed Steiner problems. Journal of Algorithms 33 (1999) 73-91
3. J. Chuzhoy, S. Khanna, Algorithms for single-source vertex-connectivity, in: FOCS, 2008, pp. 105-114
4. Y. Dodis, S. Khanna, Design networks with bounded pairwise distance, in: STOC, 1999, pp. 750-759
5. Frank A. Augmenting graphs to meet edge-connectivity requirements. SIAM Journal on Discrete Math 5 1 (1992) 25-53
6. Frank A., and Jordán T. Minimal edge-coverings of pairs of sets. Journal of Combinatorial Theory, Series B 65 (1995) 73-110
7. E. Halperin, R. Krauthgamer, Polylogarithmic inapproximability, in: STOC, 2003, pp. 585-594
8. Jain K. Factor 2 approximation algorithm for the generalized Steiner network problem. Combinatorica 21 1 (2001) 39-60
9. Kortsarz G., Krauthgamer R., and Lee J.R. Hardness of approximation for vertex-connectivity network design problems. SIAM Journal on Computing 33 3 (2004) 704-720
10. Kortsarz G., and Nutov Z. Approximating minimum-cost connectivity problems. In: Gonzalez T.F. (Ed). Approximation Algorithms and Metaheuristics (2007), Chapman & Hall/CRC
11. Kortsarz G., and Nutov Z. Tight approximation algorithm for connectivity augmentation problems. Journal of Computer and System Sciences 74 (2008) 662-670
12. Kortsarz G., and Peleg D. Approximating the weight of shallow Steiner trees. Discrete Applied Mathematics 93 2-3 (1999) 265-285
13. Z. Nutov, Approximating connectivity augmentation problems, in: SODA, 2005, pp. 176-185
14. Nutov Z. Approximating rooted connectivity augmentation problems. Algorithmica 44 (2006) 213-231
15. Z. Nutov, An almost O (log k)-approximation for k-connected subgraphs, in: SODA, 2009, pp. 912-921
16. Zelikovsky A. A series of approximation algorithms for the acyclic directed Steiner tree problem. Algorithmica 18 1 (1997) 99-110