A matter of degree: Improved approximation algorithms for degree-bounded minimum spanning trees

SIAM Journal on Computing

Volumn 31, Issue 6, 2002, Pages 1783-1793

  Konemann J ^a   Ravi, R ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

Approximation algorithms; Bicriteria approximation; Degree bounded spanning trees; Lagrangean relaxation; Network algorithms; Spanning trees

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; BOUNDARY CONDITIONS; COMPUTATIONAL COMPLEXITY; LAGRANGE MULTIPLIERS; MATHEMATICAL MODELS; MULTICASTING; NETWORK PROTOCOLS; PACKET SWITCHING;

APPROXIMATION ALGORITHMS; BICRITERIA APPROXIMATION; DEGREE BOUNDED SPANNING TREES; LAGRANGIAN RELAXATION; MINIMUM SPANNING TREES; NETWORK ALGORITHMS;

TREES (MATHEMATICS);

EID: 0036766890     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S009753970036917X     Document Type: Article

References (17)

1. F. Bauer and A. Varma, Degree-constrained multicasting in point-to-point networks, in Proceedings of the 14th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM'95), Los Alamitos, CA, 1995, pp. 369-376.
2. S. Chopra, On the spanning tree polyhedron, Oper. Res. Lett., 8 (1989), pp. 25-29.
3. S. Deering, D. Estrin, D. Farinacci, V. Jacobson, C.-G. Liu, and L. Wei, An architecture for wide-area multicast routing, in Proceedings of the 1994 ACM SIGCOMM Conference, London, UK, 1994, pp. 126-135.
4. J. Edmonds, Optimum branchings, J. Res. Nat. Bur. Standards Sect. B, 71 (1967), pp. 233-240.
5. T. Fischer, Optimizing the Degree of Minimum Weight Spanning Trees. Technical report 93-1338, Department of Computer Science University, Ithaca, NY, 1993.
6. S. Floyd, V. Jacobson, S. McCanne, C. G. Liu, and L. Zhang, A reliable multicast framework for light-weight sessions and application level framing, IEEE/ACM Trans. Networking, 5 (1997), pp. 784-803.
7. M. Fürer and B. Raghavachari, Approximating the minimum-degree Steiner tree to within one of optimal, J. Algorithms, 17 (1994), pp. 409-423.
8. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman and Company, San Francisco, 1979.
9. S. Khuller, B. Raghavachari, and N. Young, Low-degree spanning trees of small weight, SIAM J. Comput., 25 (1996), pp. 355-368.
10. P. N. Klein and R. Ravi, A nearly best-possible approximation for node-weighted Steiner trees, J. Algorithms, 19 (1995), pp. 104-115.
11. J. Könemann and R. Ravi, A matter of degree: Improved approximation algorithms for degree-bounded minimum spanning trees, in Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, Portland, OR, 2000.
12. M. V. Marathe, R. Ravi, R. Sundaram, S. S. Ravi, D. J. Rosenkrantz, and H. B. Hunt III, Bicriteria network design problems, J. Algorithms, 28 (1998), pp. 142-171.
13. G. L. Nemhauser and L. A. Wolsey, Integer and Combinatorial Optimization, John Wiley & Sons, New York, 1988.
14. R. Ravi, M. V. Marathe, S. S. Ravi, D. J. Rosenkrantz, and H. B. Hunt, Many birds with one stone: Multi-objective approximation algorithms, in Proceedings of the 25th Annual ACM Symposium on Theory of Computing, San Diego, CA, 1993, pp. 438-447.
15. A. S. Tanenbaum, Computer Networks, 3rd ed., Prentice-Hall, Upper Saddle River, NJ, 1996.
16. É. Tardos, personal communication, 2000.
17. W. De Zhong, J. Kaniyil, and Y. Onozato, A copy network with shared buffers for large-scale multicast ATM switching, IEEE/ACM Trans. Networking, 1 (1993), pp. 157-165.