## Cost-Distance: Two Metric Network Design (2000)

### Cached

### Download Links

- [www.cs.ucla.edu]
- [www.stanford.edu]
- [www.cs.duke.edu]
- [www.stanford.edu]
- [troll-w.stanford.edu]
- [www.cs.duke.edu]
- [theory.stanford.edu]
- DBLP

### Other Repositories/Bibliography

Venue: | In Proceedings of the 41st Annual IEEE Symposium on Foundations of Computer Science |

Citations: | 57 - 7 self |

### BibTeX

@INPROCEEDINGS{Meyerson00cost-distance:two,

author = {Adam Meyerson and Kamesh Munagala and Serge Plotkin},

title = {Cost-Distance: Two Metric Network Design},

booktitle = {In Proceedings of the 41st Annual IEEE Symposium on Foundations of Computer Science},

year = {2000},

pages = {624--630}

}

### Years of Citing Articles

### OpenURL

### Abstract

Abstract We present the Cost-Distance problem: 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 Cost-Distance, where k is the number of sources. We reduce many common network design problems to CostDistance, obtaining (in some cases) the first known logarithmic approximation for them. These problems include single-sink buy-at-bulk with variable pipe types between different sets of nodes, facility location with buy-at-bulk type costs on edges, and maybecast with combind cost and distance metrics. Our algorithm is also the algorithm of choice for several previous network design problems, due to its ease of implementation and fast running time. 1 Introduction Consider designing a network from the ground up. We are given a set of customers, and need to place various servers and network links in order to cheaply provide sufficient service. If we only need to place the servers, this becomes the facility location problem and constant-approximations are known. If a single server handles all customers, and we impose the additional constraint that the set of available network link types is the same for every pair of nodes (subject to constant scaling factors on cost) then this is the single sink buy-at-bulk problem. We give the first known approximation for the general version of this problem with both servers and network links. We reduce the network design problem to an elegant theoretical framework: the Cost-Distance problem. We are given a graph with a single distinguished sink node (server). Every edge in this graph can be measured along two metrics; the first will be called cost and the second will be length. Note that the two metrics are entirely independent, and that there may be any number of parallel edges in the graph. We are given a set of sources (customers). Our objective is to construct a Steiner tree connecting the sources to the sink while minimizing the combined sum of the cost of the edges in the tree and sum over sources of the weighted length from source to sink.