Proceedings 41st Annual Symposium on Foundations of Computer Science (2000)

Redondo Beach, California

Nov. 12, 2000 to Nov. 14, 2000

ISSN: 0272-5428

ISBN: 0-7695-0850-2

pp: 624

A. Meyerson , Dept. of Comput. Sci., Stanford Univ., CA, USA

K. Munagala , Dept. of Comput. Sci., Stanford Univ., CA, USA

S. Plotkin , Dept. of Comput. Sci., Stanford Univ., CA, USA

ABSTRACT

Presents the cost-distance problem, which consists of finding a Steiner tree which optimizes the sum of edge costs along one metric and the sum of source-sink distances along an unrelated second metric. We give the first known O(log k) randomized approximation scheme for the cost-distance problem, where k is the number of sources. We reduce several common network design problems to cost-distance problems, obtaining (in some cases) the first known logarithmic approximation for them. These problems include a single-sink buy-at-bulk problem with variable pipe types between different sets of nodes, facility location with buy-at-bulk-type costs on edges, constructing single-source multicast trees with good cost and delay properties, and multi-level facility location. Our algorithm is also easier to implement and significantly faster than previously known algorithms for buy-at-bulk design problems.

INDEX TERMS

facility location; trees (mathematics); network synthesis; randomised algorithms; approximation theory; computational complexity; telecommunication network routing; cost-distance problem; 2-metric network design; Steiner tree; edge cost sum optimization; source-sink distance sum optimization; randomized approximation scheme; source number; logarithmic approximation; single-sink buy-at-bulk problem; variable pipe types; cost; edges; single-source multicast trees; delay properties; multi-level facility location

CITATION

A. Meyerson, K. Munagala and S. Plotkin, "Cost-distance: two metric network design,"

*Proceedings 41st Annual Symposium on Foundations of Computer Science(FOCS)*, Redondo Beach, California, 2000, pp. 624.

doi:10.1109/SFCS.2000.892330

CITATIONS