Improved approximations for shallow-light spanning trees

Annual Symposium on Foundations of Computer Science - Proceedings

Volumn , Issue , 1997, Pages 536-541

  Naor, Joseph ^a   Schieber, Baruch ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; OPTIMIZATION; POLYNOMIALS;

BICRITERIA OPTIMIZATION PROBLEMS; POLYNOMIAL TIME ALGORITHMS; SHALLOW LIGHT SPANNING TREES;

TREES (MATHEMATICS);

EID: 0031352177     PISSN: 02725428     EISSN: None     Source Type: None    
DOI: 10.1109/SFCS.1997.646142     Document Type: Conference Paper

References (26)

1. B. Awerbuch A. Baratz D. Peleg Efficient broadcast and light-weight spanners 1991
2. A. Bookstein S. T. Klein Construction of optimal graphs for bit-vector compression Proceedings of 13th ACM SIGIR 327 342 Proceedings of 13th ACM SIGIR 1990
3. A. Bookstein S. T. Klein Compression of correlated for bit-vectors Information Services 16 387 400 1991
4. K. U. Drangmeister S. O. Krumke M. V. Marathe H. Noltemeier S. S. Ravi Modifying edges of a network to obtain short subgraphs Proceedings of WG 293 307 Proceedings of WG 1996
5. J. Edmonds Optimum branchings Journal of Research of the National Nureau of Standards B 71 233 240 1967
6. J. Edmonds Edge-disjoint branchings Courant Inst. Sci. Symp. 9 91 96 Courant Inst. Sci. Symp. 1973
7. S. Even Graph Algorithms 1979 Computer Science Press
8. U. Feige A threshold of ln n for approximating set cover Proceedings of 28th STOC 314 318 Proceedings of 28th STOC 1996
9. A. Frank L. Wittie A. Bernstein Multicast communication in network computers IEEE Software 2 49 61 1985
10. H. N. Gabow K. S. Manu Packing algorithms for arborescences (and spanning trees) in capacitated graphs Proceedings of 4th MPS Conference on Integer Programming and Combinatorial Optimization (IPCO) 388 402 Proceedings of 4th MPS Conference on Integer Programming and Combinatorial Optimization (IPCO) Copenhagen Denmark 1995
11. J. Ho D. T. Lee C. H. Chang C. K. Wong Bounded diameter spanning tree and related problems Proceedings of Annual ACM Symposium on Computational Geometry 276 282 Proceedings of Annual ACM Symposium on Computational Geometry 1989
12. V. P. Kompella J. C. Pasquale G. C. Polyzos Two distributed algorithms for the constrained Steiner tree problem 1992 San Diego CAL1005-92 Computer Systems Laboratory, University of California
13. V. P. Kompella J. C. Pasquale G. C. Polyzos Multicast routing for multimedia communication IEEE/ACM Transactions on Networking 286 292 1993
14. G. Kortsarz D. Peleg Approximating shallow-light trees Proceedings of 8th SODA 103 110 Proceedings of 8th SODA 1997
15. S. Khuller B. Raghavachari N. Young Balancing minimum spanning trees and shortest path trees Algorithmica 14 305 321 1995
16. S. O. Krumke H. Noltemeier M. V. Marathe R. Ravi S. S. Ravi Improving Steiner trees of a network under multiple constraints 1996
17. M. V. Marathe R. Ravi R. Sundaram S. S. Ravi D. J. Rosenkrantz H. B. Hunt Bicriteria network design problems Proceedings of 22nd ICALP 487 498 Proceedings of 22nd ICALP 1995
18. T. L. Magnanti L. A. Wolsey Handbooks in Operations Research and Management Science 7 1995 NorthHolland Optimal trees
19. Y. Nesterov A. Nemirovskii Interior-Point Polynomial Algorithms in Convex Programming SIAM SIAM Philadelphia 1994
20. S. Plotkin E. Tardos D. Shmoys Fast approximation algorithms for fractional packing and covering problems Mathematics of Operations Research 20 257 301 1995
21. R. Ravi M. V. Marathe S. S. Ravi D. J. Rosenkrantz H. B. Hunt Many birds with one stone: multi-objective approximation algorithms Proceedings of 25th STOC 438 447 Proceedings of 25th STOC 1993
22. Y. Shiloach Edge-disjoint branchings in directed multigraphs Information Processing Letters 8 24 27 1979
23. A. S. Tanenbaum Computer Networks 3rd 1996 Prentice Hall International Inc.
24. R. E. Tarjan A good algorithm for edge-disjoint branching Information Processing Letters 3 51 53 1974
25. P. Tong E. L. Lawler A faster algorithm for finding edge-disjoint branchings Information Processing Letters 17 73 76 1983
26. Q. Zhu M. Parsa W. W-M. Dai An iterative approach for delay-bounded minimum Steiner tree construction 1994 Santa Cruz UCSC-CRL-94-39 UC