Bicriteria network design problems

Journal of Algorithms

Volumn 28, Issue 1, 1998, Pages 142-171

  Marathe, Madhav V ^a   Ravi, R ^b,e   Sundaram, Ravi ^c,f   Ravi, S S ^d   Rosenkrantz, Daniel J ^d   Hunt III, Harry B ^d  

^a LOS ALAMOS NATIONAL LABORATORY   (United States)

^b CARNEGIE MELLON UNIVERSITY   (United States)

^c Delta Trading Co   (United States)

^d State University of New York   (United States)

^e PRINCETON UNIVERSITY   (United States)

^f MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Approximation algorithms; Bicriteria problems; Combinatorial algorithms; Network design; Spanning trees

Indexed keywords

EID: 0003165381     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1006/jagm.1998.0930     Document Type: Article

References (34)

1. S. Arora and M. Sudan, Improved low-degree testing and its applications, in "Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing (STOC)," 1997, pp. 485-496.
2. B. Awerbuch, A. Baratz, and D. Peleg, Cost-sensitive analysis of communication protocols, in "Proceedings of the Ninth Symposium on Principles of Distributed Computing (PODC)," 1990, pp. 177-187.
3. S. Arnborg, B. Courcelle, A. Proskurowski, and D. Seese, An algebraic theory of graph reductions, J. ACM (JACM) 40(5) (1993), pp. 1134-1164.
4. A. Agrawal, P. Klein, and R. Ravi, When trees collide: an approximation algorithm for the generalized Steiner problem on networks, SIAM J. Comput. 24 (1995), 440-456.
5. S. Arnborg, J. Lagergren, and D. Seese, Easy problems for tree-decomposable graphs, J. Algorithms 12 (1991), pp. 308-340.
6. H. L. Bodlaender, Dynamic programming on graphs of bounded treewidth, in "Proceedings of the Fifteenth International Colloquium on Automata Language and Programming," LNCS Vol. 317, 1988, pp. 105-118.
7. A. Bookstein and S. T. Klein, Construction of optimal graphs for bit-vector compression, in "Proceedings of the Thirteenth ACM-SIGIR," Vol. 16, 1990, pp. 387-400.
8. M. W. Bern, E. L. Lawler, and A. L. Wong, Linear-time computation of optimal subgraphs of decomposable graphs, J. Algorithms 8 (1987), 216-235.
9. P. M. Camerini and G. Galbiati, The bounded path problems, SIAM J. Algebraic Discrete Methods 3(4) (1982), pp. 474-484.
10. R. Chandrasekaran, Minimum ratio spanning trees, Networks 7 (1977), 335-342.
11. T. H. Cormen, C. E. Leiserson, and R. L. Rivest, "Introduction to Algorithms," McGraw-Hill, New York, 1990.
12. C.-H. Chow, On multicast path finding algorithms, in "Proceedings of IEEE INFOCOM 1991," (1991), pp. 1274-1283.
13. P. Crescenzi and V. Kann, A compendium of NP optimization problems, manuscript, 1995.
14. A. Frank, L. Wittie, and A. Bernstein, Multicast communication in network computers, IEEE Software 2(3) (1985), pp. 49-61.
15. J. L. Ganley, M. J. Golin, and J. S. Salowe, The multi-weighted spanning tree problem, in "Proceedings of the First Conference on Combinatorics and Computing (COCOON)," LNCS, Springer-Verlag, Berlin/New York, 1995, pp. 141-150.
16. M. R. Garey and D. S. Johnson, "Computers and Intractability: A Guide to the Theory of NP-Completeness," Freeman, San Francisco, 1979.
17. M. X. Goemans and D. P. Williamson, A general approximation technique for constrained forest problems, SIAM J. Comput. 24 (1995), pp. 296-317.
18. R. Hassin, Approximation schemes for the restricted shortest path problem, Math. Oper. Res. 17(1) (1992), pp. 36-42.
19. J. Ho, D. T. Lee, C. H. Chang, and C. K. Wong, Bounded diameter spanning tree and related problems, in "Proceedings of the Annual ACM Symposium on Computational Geometry," 1989, pp. 276-282.
20. D. Hochbaum, "Approximation Algorithms for NP-Hard Problems," (D. S. Hochbaum, Ed.), PWS-Kent, Boston, MA, 1997.
21. B. Kadaba and J. Jaffe, Routing to multiple destinations in computer networks, IEEE Trans. Commun. COM-31 (March 1983), pp. 343-351.
22. S. Khuller, B. Raghavachari, and N. Young, Balancing minimum spanning and shortest path trees, Algorithmica 14(4) (1995), pp. 305-321.
23. V. P. Kompella, J. C. Pasquale, and G. C. Polyzos, Multicasting for multimedia applications, in "Proceedings of IEEE INFOCOM 1992," May 1992.
24. V. P. Kompella, J. C. Pasquale, and G. C. Polyzos, Multicast routing for multimedia communication, in "IEEE/ACM Transactions on Networking," 1993, pp. 286-292.
25. G. Kortsarz and D. Peleg, Approximation algorithms for minimum time broadcast, SIAM J. Discrete Math. 8(3) (1995), pp. 401-427.
26. G. Kortsarz and D. Peleg, Approximating shallow light trees, in "Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms," 1997, pp. 103-110.
27. N. Megiddo, Applying parallel computation algorithms in the design of serial algorithms, J. ACM 30 (1983), pp. 852-865.
28. C. Phillips, The network inhibition problem, in "Proceedings of the Twenty-Fifth Annual ACM Symposium on the Theory of Computing," 1993, pp. 776-785.
29. R. Ravi, Rapid rumor ramification: approximating the minimum broadcast time, in "Proceedings of the Thirty-Fifth Annual IEEE Foundations of Computer Science," 1994, pp. 202-213.
30. R. Ravi and M. Goemans, The constrained spanning tree problem, in "Proceedings of the Fifth Scandinavian Workshop on Algorithmic Theory," Reykjavik, Iceland, LNCS Vol. 1097, July 1996, pp. 66-75.
31. R. Ravi, M. V. Marathe, S. S. Ravi, D. J. Rosenkrantz, and H. B. Hunt III, Many birds with one stone: multi-objective approximation algorithms, in "Proceedings of the Twenty-Fifth Annual ACM Symposium on the Theory of Computing," 1993, pp. 438-447. (Expanded version appears as Brown University Technical Report TR-CS-92-58.)
32. R. Raz and S. Safra, A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP, in "Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing," 1997, pp. 475-484.
33. A. Warburton, Approximation of Pareto optima in multiple-objective, shortest path problems, Oper. Res. 35 (1987), pp. 70-79.
34. Q. Zhu, M. Parsa, and W. W. M. Dai, "An Iterative Approach for Delay-Bounded Minimum Steiner Tree Construction," Technical Report UCSC-CRL-94-39, UC Santa Cruz, 1994.