An O(log* n) Approximation Algorithm for the Asymmetric p-Center Problem

Journal of Algorithms

Volumn 27, Issue 2, 1998, Pages 259-268

  Panigrahy, Rina ^a   Vishwanathan, Sundar ^b  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b INDIAN INSTITUTE OF TECHNOLOGY BOMBAY   (India)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0008159601     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1006/jagm.1997.0921     Document Type: Article

References (12)

1. A. V. Aho, J. E. Hopcroft, and J. D. Ullman, "The Design and Analysis of Computer Algorithms," Addison-Wesley, Reading, MA, 1974.
2. B. Bollobas, "Combinatorics," Cambridge Univ. Press, 1986.
3. V. Chvatal, A greedy heuristic for the set covering problem. Math. Oper. Res. 4 (1979), 233-235.
4. M. Dyer and A. Frieze, A simple heuristic for the p-center problem, Oper. Res. Lett. 3 (1991), 285-288.
5. M. R. Garey and D. Johnson, "Computers and Intractability: A Guide to the Theory of NP-Completeness," Freeman, San Francisco, 1979.
6. D. S. Hochbaum and D. B. Shmoys, A best possible approximation algorithm for the k-center problem, Math. Oper. Res. 10 (1985), 180-184.
7. W. L. Hsu and G. L. Nemhauser, Easy and hard bottleneck location problems, Discrete Appl. Math. 1 (1979), 209-216.
8. D. S. Johnson, Approximation algorithms for combinatorial problems, J. Comput. System Sci. 9 (1978), 256-278.
9. L. Lovasz, On the ratio of optimal integral and fractional covers, Discrete Math. 13 (1975), 383-390.
10. C. Lund and M. Yannakakis, On the hardness of approximating minimization problems, in "Proceedings of the ACM STOC," pp. 286-293, 1993.
11. D. B. Shmoys, Computing near-optimal solutions to combinatorial optimization problems, in "Advances in Combinatorial Optimization" (W. Cook, L. Lovasz, and P. Seymour, Eds.), Amer. Math. Soc., Providence, pp. 355-397, 1995.
12. R. E. Tarjan, "Data Structures and Network Algorithms," SIAM, Philadelphia, 1983.