Abstract
We study several bicriteria network design problems phrased as follows: given an undirected graph and two minimization objectives with a budget specified on one objective, find a subgraph satisfying certain connectivity requirements that minimizes the second objective subject to the budget on the first. First, we develop a formalism for bicriteria problems and their approximations. Secondly, we use a simple parametric search technique to provide bicriteria approximation algorithms for problems with two similar criteria, where both criteria are the same measure (such as the diameter or the total cost of a tree) but differ only in the cost function under which the measure is computed. Thirdly, we present an (O(log n), O(log n))-approximation algorithm for finding a diameter-constrained minimum cost spanning tree of an undirected graph on n nodes. Finally, for the class of treewidth-bounded graphs, we provide pseudopolynomial-time algorithms for a number of bicriteria problems using dynamic programming. These pseudopolynomial-time algorithms can be converted to fully polynomialtime approximation schemes using a scaling technique.
Supported by NSF Grants CCR 94-06611 and CCR 90-06396.
Research supported by the Department of Energy under Contract W-7405-ENG-36.
Research supported by a DIMACS postdoctoral fellowship.
Research supported by DARPA contract N0014-92-J-1799 and NSF CCR 92-12184.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
S. Arnborg, J. Lagergren and D. Seese, “Easy Problems for Tree-Decomposable Graphs,” J. Algorithms, Vol. 12, 1991, pp. 308–340.
S. Arnborg, B. Courcelle, A. Proskurowski and D. Seese, “An Algebraic Theory of Graph Problems,” J. ACM, Vol. 12, 1993, pp. 308–340.
B. Awerbuch, A. Baratz, and D. Peleg, “Cost-sensitive analysis of communication protocols,” Proc. of 9th Symp. on Principles of Distributed Computing (PODC), pp. 177–187, (1990).
M. Bellare, S. Goldwasser, C. Lund, and A. Russell, “Efficient probabilistically checkable proofs,” Proceedings of the 25th Annual ACM Symposium on the Theory of Computing (1993), pp. 294–304.
M.W. Bern, E.L. Lawler and A.L. Wong, “Linear-Time Computation of Optimal Subgraphs of Decomposable Graphs,” J. Algorithms, Vol. 8, 1987, pp. 216–235.
H.L. Bodlaender, “Dynamic programming on graphs of bounded treewidth,” Proc. of the 15th ICALP, LNCS Vol. 317, 1988, pp. 105–118.
P. M. Camerini, and G. Galbiati, “The bounded path problem,” SIAM J. Alg. Disc., Meth. Vol. 3, No. 4 (1982), pp. 474–484.
C.-H. Chow, “On multicast path finding algorithms,” Proc. of IEEE INFOCOM '91, pp. 1274–1283 (1991).
A. Frank, L. Wittie, and A. Bernstein, “Multicast communication in network computers,” IEEE Software, Vol. 2, No. 3, pp. 49–61 (1985).
M. R. Garey and D. S. Johnson, Computers and Intractability: A guide to the theory of NP-completeness, W. H. Freeman, San Francisco (1979).
R. Hassin, “Approximation schemes for the restricted shortest path problem,” Math. of O. R., Vol. 17, No. 1, pp. 36–42 (1992).
B. Kadaba and J. Jaffe, “Routing to multiple destinations in computer networks,” IEEE Trans. on Comm., Vol. COM-31, pp. 343–351, (Mar. 1983).
S. Khuller, B. Raghavachari, and N. Young, “Balancing Minimum Spanning and Shortest Path Trees,“ Proc., Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (1993), pp. 243–250.
V.P. Kompella, J.C. Pasquale and G.C. Polyzos, “Multicasting for multimedia applications,” Proc. of IEEE INFOCOM '92, (May 1992).
V.P. Kompella, J.C. Pasquale and G.C. Polyzos, “Multicast Routing for Multimedia Communication,” IEEE/ACM Transactions on Networking, pp. 286–292, (1993).
G. Kortsarz and D. Peleg, “Approximation algorithms for minimum time broadcast,” Proc. of the 1992 Israel Symposium on Theoretical Computer Science LNCS 601, (1994).
C. Lund and M. Yannakakis, “On the Hardness of Approximating Minimization Problems,” Proc., 25th Annual ACM Symp. on Theory of Computing, (1993), pp. 286–293.
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,” Proc. of the 25th Annual ACM Symposium on the Theory of Computing (1993), pp. 438–447.
R. Ravi, R. Sundaram, M. V. Marathe, D. J. Rosenkrantz, and S. S. Ravi, “Spanning trees short or small,” in Proc. of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms, (1994), pp 546–555.
R. Ravi, “Rapid Rumor Ramification: Approximating the minimum broadcast time,” in Proc. of the 25th Annual IEEE Foundations of Computer Science (1994), pp. 202–213.
N. Robertson and P. Seymour, “Graph Minors IV, Tree-width and wellquasi-ordering,” J. Combin. Theory Ser. B 48, 227–254 (1990).
A. Warburton, “Approximation of Pareto optima in multiple-objective, shortest path problems,” Oper. Res. 35, pp. 70–79 (1987).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Marathe, M.V., Ravi, R., Sundaram, R., Ravi, S.S., Rosenkrantz, D.J., Hunt, H.B. (1995). Bicriteria network design problems. In: Fülöp, Z., Gécseg, F. (eds) Automata, Languages and Programming. ICALP 1995. Lecture Notes in Computer Science, vol 944. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60084-1_99
Download citation
DOI: https://doi.org/10.1007/3-540-60084-1_99
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60084-8
Online ISBN: 978-3-540-49425-6
eBook Packages: Springer Book Archive