Many birds with one stone: Multi-objective approximation algorithms

Many birds with one stone: Multi-objective approximation algorithms (1992)

Cached

Download Links

[wilma.cs.brown.edu]

Other Repositories/Bibliography

DBLP

by R. Ravi , M.V. Marathe , S. S. Ravi , D. J. Rosenkrantz , H. B. Hunt III

Citations:

46 - 13 self

Versions

Version History

Metadata Version 3

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	Many birds with one stone: Multi-objective approximation algorithms	user correction - Legacy Corrections
AUTHOR NAME	S.S. Ravi	user correction - Legacy Corrections
AUTHOR AFFIL	1	user correction - Legacy Corrections
AUTHOR NAME	M.V. Marathe	user correction - Legacy Corrections
AUTHOR NAME	S. S. Ravi	user correction - Legacy Corrections
AUTHOR AFFIL	3	user correction - Legacy Corrections
AUTHOR NAME	D. J. Rosenkrantz	user correction - Legacy Corrections
AUTHOR AFFIL	4	user correction - Legacy Corrections
AUTHOR NAME	H. B. Hunt Iii	user correction - Legacy Corrections
AUTHOR AFFIL	; 5; 1; Brown University Box 1910, Providence; 2; 3; 4; 5; Dept. of Computer Science, Brown University, Providence, RI 02912.	user correction - Legacy Corrections
AUTHOR ADDR	; RI 02912; University at Albany-Suny NY 12222; University at Albany-Suny NY 12222; University at Albany-Suny NY 12222; University at Albany-Suny NY 12222	user correction - Legacy Corrections
ABSTRACT	We study network-design problems with multiple design objectives. In particular, we look at two cost measures to be minimized simultaneously: the total cost of the network and the maximum degree of any node in the network. Our main result can be roughly stated as follows: given an integer b, we present approximation algorithms for a variety of network-design problems on an n- node graph in which the degree of the output network is O(b log( n b )) and the cost of this network is O(log n) times that of the minimum-cost degree-b-bounded network. These algorithms can handle costs on nodes as well as edges. Moreover, we can construct such networks so as to satisfy a variety of connectivity specifications including spanning trees, Steiner trees and generalized Steiner forests. The performance guarantee on the cost of the output network is nearly best-possible unless NP = ~ P . We also address the special case in which the costs obey the triangle inequality. In this case, we obtai...	user correction - Legacy Corrections
YEAR	1993	user correction - Legacy Corrections
CITATIONS	29 found	ParsCit 1.0