An approximation algorithm for the edge-dilation k-center problem

Authors:
Jochen KöNemann;Yanjun Li;Ojas Parekh;Amitabh Sinha
Affiliations:
Carnegie Mellon University, Pittsburgh, USA;Purdue University, West Lafayette, Krannert School of Management, IN 47907, USA;Sandia National Labs, Albuquerque, USA;GSIA, Carnegie Mellon University, 5000 Forbes Avenue, Pittsburgh, PA 15213, USA
Venue:
Operations Research Letters
Year:
2004

Citing 6
Cited 0

A heuristic for the p-center problem in graphs

Discrete Applied Mathematics
An optimal synchronizer for the hypercube

SIAM Journal on Computing
Compact routing with minimum stretch

Journal of Algorithms
(1 + &egr;&Bgr;)-spanner constructions for general graphs

STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Approximation Algorithms for Edge-Dilation k-Center Problems

SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
A simple heuristic for the p-centre problem

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

We provide an approximation algorithm for selecting centers in a complete graph so as to minimize the maximum ratio of the distance between any two nodes via their respective centers to their true graph distance. Placing centers under such an objective function is important in designing efficient communication networks which rely on hubs for routing.