Asymmetric k-Center is log* n-hard to approximate

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2004, Pages 21-27

  Chuzhoy, Julia ^a   Guha, Sudipto ^b   Halperin, Eran ^c   Khanna, Sanjeev ^b   Kortsarz, Guy ^d   Naor, Joseph ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b UNIVERSITY OF PENNSYLVANIA   (United States)

^c UNIVERSITY OF CALIFORNIA   (United States)

^d RUTGERS UNIVERSITY   (United States)

Author keywords

Approximation Algorithms; Asymmetric k center; Hardness of Approximation; Metric k center

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; PARAMETER ESTIMATION; POLYNOMIALS; PROBLEM SOLVING;

ASYMMETRIC K-CENTERS; GROUP-STEINER-TREE PROBLEMS; HARDNESS OF APPROXIMATION; POLY-LOGARITHMIC FACTORS;

COMPUTATIONAL COMPLEXITY;

EID: 4544247131     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1007352.1007363     Document Type: Conference Paper

References (22)

1. S. Arora and C. Lund. Hardness of approximation. In Dorit Hochbaum, editor, Approximation Algorithms for NP Hard Problems. PWS publishing Co, 1996.
2. S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy. Proof verification and the hardness of approximation problems. JACM, 45(3):501-555, 1998.
3. A. F. Archer. Two O(log* k)-approximation algorithms for the asymmetric k-center problem. Proceedings of the 8th Conference on Integer Programming and Combinatorial Optimization, pages 1-14, 2001.
4. S. Arora and S. Safra. Probabilistic checking of proofs: A new characterization of NP. JACM, 45(1):70-122, 1998.
5. M. Charikar, S. Khuller, D. M. Mount, and G. Narasimhan. Algorithms for facility location problems with outliers. Proceedings of the ACM-SIAM symposium on Discrete Algorithms 2001.
6. M. E. Dyer and A. M. Frieze. A simple heuristic for the p-centre problem. Oper. Res. Lett., 3(6):285-288, 1985.
7. I. Dinur, V. Guruswami, and S. Khot. Vertex cover on k-uniform hypergraphs is hard to approximate within factor (k -3 - ε). Electronic Colloquium on Computational Complexity (ECCC), (027), 2002.
8. th ACM Symposium on Theory of Computing, 2003.
9. rd IEEE conference on Foundations of Computer Science, 2002.
10. th ACM Symposium on Theory of Computing, 2002.
11. M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-completeness. W.H. Freeman and Company, 1979.
12. T. F. Gonzalez. Clustering to minimize the maximum intercluster distance. Theoret. Comput. Sci., 38(2-3):293-306, 1985.
13. th ACM Symposium on Theory of Computing, 2003.
14. th SIAM Symposium on Discrete Algorithms, 2003.
15. W. L. Hsu and G. L. Nemhauser. Easy and hard bottleneck location problems. Discrete Applied Math., 1(3):209-215, 1979.
16. th ACM Symposium on Theory of Computing, pages 544-552, 2002.
17. D. S. Hochbaum and D. B. Shmoys. A unified approach to approximation algorithms for bottleneck problems. JACM, 33(3):533-550, 1986.
18. J. Plesník. On the computational complexity of centers locating in a graph. Aplikace Matematiky, 25(6):445-452, 1980.
19. R. Panigrahy and S. Vishwanathan. An O(log*n) approximation algorithm for the asymmetric p-center problem. J. of Algorithms, 27(2):259-268, 1998.
20. R. Raz. A parallel repetition theorem. SIAM J. of Computing, 27(3):763-803, 1998.
21. D.B. Shmoys. Computing near-optimal solutions to combinatorial optimization problems. In Combinatorial Optimization, pages 355-397. AMS, 1995.
22. V. V. Vazirani. Approximation Algorithms. Springer Verlag, 2001.