Approximation algorithms for finding low-degree subgraphs

Networks

Volumn 44, Issue 3, 2004, Pages 203-215

  Klein, Philip N ^a   Krishnan, Radha ^b   Raghavachari, Balaji ^b   Ravi, R ^c  

^a Brown Univerity   (United States)

^b The University of Texas at Dallas   (United States)

^c CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

Approximation algorithms; Graph algorithms; Graph connectivity; Minimum degree subgraphs; Network design; NP hard problems

Indexed keywords

APPROXIMATION ALGORITHMS; GRAPH ALGORITHMS; GRAPH CONNECTIVITY; MINIMUM-DEGREE SUBGRAPHS; NETWORK DESIGNS;

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; HAMILTONIANS; INTEGER PROGRAMMING; ITERATIVE METHODS; LAGRANGE MULTIPLIERS; POLYNOMIALS; TELECOMMUNICATION NETWORKS;

GRAPH THEORY;

EID: 4644275367     PISSN: 00283045     EISSN: None     Source Type: Journal    
DOI: 10.1002/net.20031     Document Type: Article

References (20)

1. A. Agrawal, P. Klein, and R. Ravi, How tough is the minimum-degree Steiner tree? An approximate min-max equality (complete with algorithms), Tech Rep-CS-91-49, Brown University, 1991.
2. A. Agrawal, P. Klein, and R. Ravi, When trees collide: An approximation algorithm for the generalized Steiner tree problem on networks, SIAM J Comput 24 (1995), 445-456.
3. D. Bauer, S.L. Hakimi, and E. Schmeichel, Recognizing tough graphs is NP-hard, Discrete Appl Math 28 (1990), 191-195.
4. V. Chvátal, Tough graphs and Hamiltonian circuits, Discrete Math 5 (1973), 215-228.
5. M. Fürer and B. Raghavachari, An Nl approximation algorithm for the minimum-degree spanning tree problem, Proc 28th Ann Allerton Conference on Communication, Control and Computing, Monticello, IL, 1990, pp. 274-281.
6. M. Fürer and B. Raghavachari, Approximating the minimum-degree spanning tree to within one from the optimal degree, Proc 3rd Ann ACM-SIAM Symp Discrete Algorithms, Orlando, FL, 1992, pp. 317-324.
7. M. Fürer and B. Raghavachari, Approximating the minimum-degree Steiner tree to within one of optimal, J Algorithms 17 (1994), 409-423.
8. H.N. Gabow, M.X. Goemans, and D.P. Williamson, An efficient approximation algorithm for the survivable network design problem, Math Program 82 (1998), 13-40.
9. M.R. Garey and D.S. Johnson, Computers and intractability: A guide to the theory of NP-completeness, W.H. Freeman, San Francisco, 1979.
10. B. Gavish, Topological design of centralized computer networks - Formulations and algorithms, Networks 12 (1982), 355-377.
11. M.X. Goemans and D.P. Williamson, A general approximation technique for constrained forest problems, SIAM J Comput 24 (1995), 296-317.
12. M. Grötschel, L. Lovász, and A. Schrijver, Geometric algorithms and combinatorial optimization, Springer-Verlag, Berlin, 1988.
13. J. Könemann and R. Ravi, A matter of degree: Improved approximation algorithms for degree-bounded minimum spanning trees, SIAM J Comput 31 (2002), 1783-1793.
14. J. Könemann and R. Ravi, Primal-dual meets local search: Approximating MST's with nonuniform degree bounds, Proc 35th Ann Symp Theory Comput ACM, San Diego, CA, 2003, pp. 389-395.
15. J. Könemann and R. Ravi, Quasi-polynomial time approximation algorithm for low-degree minimum-cost Steiner trees, Proc 23rd Conf Foundations of Software Technology and Theoretical Computer Science, Mumbai, India, Lecture Notes in Computer Science 2914, Springer 2003, pp. 289-301.
16. E.L. Lawler, Combinatorial optimization: Networks and matroids, Holt, Rinehart and Winston, New York, 1976.
17. G.L. Nemhauser and L.A. Wolsey, Integer and combinatorial optimization, Wiley, New York, 1988.
18. R. Ravi, M.V. Marathe, S.S. Ravi, D.J. Rosenkrantz, and H.B. Hunt, III, Approximation algorithms for degree-constrained minimum-cost network-design problems, Algorithmica 31 (2001), 58-78.
19. D.P. Williamson, M.X. Goemans, M. Mihail, and V. Vazirani, A primal-dual approximation algorithm for generalized Steiner network problems, Combinatorica 15 (1995), 435-454.
20. S. Win, On a connection between the existence of k-trees and the toughness of a graph, Graphs Combinatorics 5 (1989), 201-205.