An O(log∗n) approximation algorithm for the asymmetric p-center problem

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn Part F129447, Issue , 1996, Pages 1-5

  Vishwanathan, Sundar ^a  

^a INDIAN INSTITUTE OF TECHNOLOGY BOMBAY   (India)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS;

DISTANCE MATRICES; MINIMUM DISTANCE; NP COMPLETE; P-CENTER PROBLEMS; SYMMETRIC CASE; TRIANGLE INEQUALITY; VERTEX SET;

APPROXIMATION ALGORITHMS;

EID: 85012930147     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (13)

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 University Press, 1986.
3. V. Chvatal, A greedy heuristic for the set covering problem, Mathematics of Operations Research, 4 (1979), pp. 233-235.
4. M. Dyer and A. Frieze, A simple heuristic for the p-center problem, Oper. Res. Lett., 3 (1991), pp. 285-288.
5. M. R. Garey and D. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, San Fransisco, 1979.
6. D. S. Hochbaum and D. B. Shmoys, A best possible approximation algorithm for the k-center problem, Math. Oper. Res. 10 (1985), pp. 180-184.
7. W. L. Hsu and G. L. Nemhauser, Easy and hard bottleneck location problems, Discrete Appl. Math., 1 (1979), pp. 209-216.
8. D. S. Johnson, Approximation Algorithms for Combinatorial Problems, JCSS, 9 (1978), pp. 256-278.
9. L. Lovasz, On the ratio of optimal integral and fractional covers, Discrete Mathematics, 13 (1975), pp. 383-390.
10. C. Lund and M. Yannakakis, On the hardness of approximating minimization problems, Proceedings of ACM STOC, pages 286-293, 1993.
11. Rina Panigrahy, An O(log n) approximation algorithm for the asymmetric p-center problem, Submitted.
12. D. B. Shmoys, Computing Near-Optimal Solutions to Combinatorial Optimization Problems, Manuscript.
13. R. E. Tarjan, Data Structures and Network Algorithms, SIAM, Pittsburgh, PA, 1983.