Approximating the smallest k-edge connected spanning subgraph by LP-rounding

Networks

Volumn 53, Issue 4, 2009, Pages 345-357

  Gabow, Harold N ^a   Goemans, Michel X ^b   Tardos, Éva ^c   Williamson, David P ^d  

^a UCB 450   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^c Department of Computer Science and School of Operations Research and Information Engineering   (United States)

^d Cornell University   (United States)

Author keywords

Approximation algorithms; Edge connectivity; Graph connectivity; Linear program; LP rounding; MAX SNP hardness; Network design

Indexed keywords

EDGE CONNECTIVITY; GRAPH CONNECTIVITY; LINEAR PROGRAM; LP-ROUNDING; MAX SNP-HARDNESS; NETWORK DESIGN;

GRAPH THEORY; HARDNESS;

APPROXIMATION ALGORITHMS;

EID: 67651087393     PISSN: 00283045     EISSN: 10970037     Source Type: Journal    
DOI: 10.1002/net.20289     Document Type: Article

References (16)

1. Cheriyan and R. Thurimella, Approximating minimumsize κ-connected spanning subgraphs via matching, SIAM J Comput 30(2000), 528-560.
2. Cornuéjols, J. Fonlupt, and D. Naddef, The traveling salesman problem on a graph and some related integer polyhedra, Math Program 33(1985), 1-27.
3. Fernandes, A better approximation ratio for the minimum size κ-edge-connected spanning subgraph problem, J Algorithms 28(1998), 105-124.
4. Frank, Submodular functions in graph theory, Discr Math 111(1993), 231-243.
5. Gabow, On the difficulty of κ-connected spanning subgraph problems, unpublished notes.
6. Gabow, Special edges, and approximating the smallest directed κ-edge connected spanning subgraph, Proc 15th Ann ACM-SIAM Symp Discr Algorithms, New Orleans, Louisiana, 2004, pp. 227-236.
7. Gabow, An improved analysis for approximating the smallest κ-edge connected spanning subgraph of a multigraph, SIAM J Disc Math 19(2005), 1-18.
8. ∞-norm of extreme points for crossing supermodular directed network LPs, Math Program B 110(2007), 111-144.
9. Jain, A factor 2 approximation algorithm for the generalized steiner network problem, Combinatorica 21(2001), 39-60.
10. Karger, Random samplingincut, flow, and network design problems, Math OR 24(1999), 383-413.
11. Karp, "Reducibility among combinatorial problems", Complexity of computer computations, R. Miller and J. Thatcher (Editors), Plenum Press, NY, 1972, pp. 85-103.
12. Khuller and B. Raghavachari, Improved approximation algorithms for uniform connectivity problems, J Algorithms 21(1996), 434-450.
13. Khuller, B. Raghavachari, and N. Young, Approximating the minimum equivalent digraph, SIAM J Comput 24(1995), 859-872.
14. Melkonian and E. Tardos, Algorithms foranetwork design problem with crossing supermodular demands, Networks 43, (2004), 256-265.
15. Schrijver, Combinatorial optimization: Polyhedra and efficiency, Vol. A, Springer, NY, 2003.
16. Vazirani, Approximation algorithms, Springer-Verlag, NY, 2001.