Abstract
Given a set V of n points andthe distances between each pair, the k-center problem asks us to choose a subset C ⊆ V of size k that minimizes the maximum over all points of the distance from C to the point. This problem is NP-hardev en when the distances are symmetric andsatisfy the triangle inequality, andHo chbaum andShmo ys gave a best-possible 2-approximation for this case.
We consider the version where the distances are asymmetric. Panigrahy andVish wanathan gave an O(log* n)-approximation for this case, leading many to believe that a constant approximation factor shouldb e possible. Their approach is purely combinatorial. We show how to use a natural linear programming relaxation to define a promising new measure of progress, anduse it to obtain two different O(log* k)-approximation algorithms. There is hope of obtaining further improvement from this LP, since we do not know of an instance where it has an integrality gap worse than 3.
Supported by the Fannie and John Hertz Foundation and ONR grant AASERT N0014-97-10681.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
A. Archer, “Inapproximability of the asymmetric facility location and k-median problems,” unpublished manuscript.
M. Charikar and S. Guha, “Improvedcom binatorial algorithms for the facility location and k-median problems,” Proc. 40th Annual IEEE Symp. on Foundations of Computer Science, (1999) 378–388.
V. Chvatal, “A greedy heuristic for the set covering problem,” Math. Oper. Res., 4 (1979) 233–235.
M. Dyer and A. Frieze, “A simple heuristic for the p-centre problem,” Oper. Res. Lett., 3 (1985) 285–288.
D. S. Hochbaum, “Heuristics for the fixedcost median problem,” Math. Prog., 22 (1982) 148–162.
D. S. Hochbaum and D. B. Shmoys, “A best possible heuristic for the k-center problem,” Math. Oper. Res. 10 (1985) 180–184.
D. S. Hochbaum and D. B. Shmoys, “A unifiedapproac h to approximation algorithms for bottleneck problems,” J. ACM, 33 (1986) 533–550.
D. S. Johnson, “Approximation algorithms for combinatorial problems,” J. Computer and System Sciences, 9 (1974) 256–278.
J. Kleinberg, personal communication, November 1999.
J.-H. Lin and J. S. Vitter, “∈-approximations with minimum packing constraint violation”, Proc. 24th Annual ACM Symp. on Theory of Computing, (1992) 771–782.
L. Lovász, “On the ratio of optimal integral and fractional covers,” Discrete Math., 13 (1975) 383–390.
R. O’Donnell, personal communication, June 2000.
R. Panigrahy and S. Vishwanathan, “An O(log* n) approximation algorithm for the asymmetric p-center problem,” J. Algorithms, 27 (1998) 259–268.
S. Vishwanathan, “An O(log* n) approximation algorithm for the asymmetric p-center problem,” Proc. 7th Annual ACM-SIAM Symp. on Discrete Algorithms, (1996) 1–5.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Archer, A. (2001). Two O(log* k)-Approximation Algorithms for the Asymmetric k-Center Problem. In: Aardal, K., Gerards, B. (eds) Integer Programming and Combinatorial Optimization. IPCO 2001. Lecture Notes in Computer Science, vol 2081. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45535-3_1
Download citation
DOI: https://doi.org/10.1007/3-540-45535-3_1
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42225-9
Online ISBN: 978-3-540-45535-6
eBook Packages: Springer Book Archive