Bicriteria network design problems
- Los Alamos National Lab., NM (United States)
- Princeton Univ., NJ (United States). Dept. of Computer Science
- Massachusetts Inst. of Tech., Cambridge, MA (United States). Dept. of Computer Science
- State Univ. of New York, Albany, NY (United States). Dept. of Computer Science
We study several bicriteria network design problems phrased as follows: given an indirected 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 polynomial-time approximation schemes using a scaling technique.
- Research Organization:
- Los Alamos National Lab., NM (United States)
- Sponsoring Organization:
- USDOE, Washington, DC (United States)
- DOE Contract Number:
- W-7405-ENG-36
- OSTI ID:
- 68143
- Report Number(s):
- LA-UR--95-1411; CONF-9506188--1; ON: DE95012052
- Country of Publication:
- United States
- Language:
- English
Similar Records
Bicriteria network design problems
Improving Steiner trees of a network under multiple constraints