Asymmetric K-center Is log* H-hard to approximate

Journal of the ACM

Volumn 52, Issue 4, 2005, Pages 538-551

  Chuzhoy, Julia ^a,g   Guha, Sudipto ^b,h   Halperin, Eran ^c,d,i   Khanna, Sanjeev ^b,h   Kortsarz, Guy ^e   Krauthgamer, Robert ^c,d,i,j   Naor, Joseph ^f  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b UNIVERSITY OF PENNSYLVANIA   (United States)

^c INTERNATIONAL COMPUTER SCIENCE INSTITUTE   (United States)

^d UNIVERSITY OF CALIFORNIA   (United States)

^e RUTGERS UNIVERSITY   (United States)

^f TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^g MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^h UNIVERSITY OF PENNSYLVANIA   (United States)

ⁱ UNIVERSITY OF CALIFORNIA   (United States)

^j IBM ALMADEN RESEARCH CENTER   (United States)

more..

Author keywords

Approximation algorithms; Asymmetric k center; Hardness of approximation; Metric k center

Indexed keywords

ASYMMETRIC K-CENTER; HARDNESS OF APPROXIMATION; METRIC K-CENTER;

ALGORITHMS; APPROXIMATION THEORY; COSTS; GRAPH THEORY;

PROBLEM SOLVING;

EID: 30544437241     PISSN: 00045411     EISSN: 00045411     Source Type: Journal    
DOI: 10.1145/1082036.1082038     Document Type: Article

References (23)

1. ARCHER, A. F. 2001. Two O(log* k)-approximation algorithms for the asymmetric k-center problem. In Proceedings of the 8th Conference on Integer Programming and Combinatorial Optimization, pp. 1-14.
2. ARORA, S., AND LUND, C. 1996. Hardness of approximation. In Approximation Algorithms for NP Hard Problems, Dorit Hochbaum, Ed. PWS Publishing Company.
3. ARORA, S., LUND, C., MOTWANI, R., SUDAN, M., AND SZEGEDY, M. 1998. Proof verification and the hardness of approximation problems. J. ACM 45, 3, 501-555.
4. ARORA, S., AND SAFRA, S. 1998. Probabilistic checking of proofs: A new characterization of NP. J. ACM 45, 1, 70-122.
5. CHARIKAR, M., KHULLER, S., MOUNT, D. M., AND NARASIMHAN, G. 2001. Algorithms for facility location problems with outliers. In Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms. ACM, New York, pp. 642-651.
6. DINUR, I., GURUSWAMI, V., AND KHOT, S. 2002b. Vertex cover on k-uniform hypergraphs is hard to approximate within factor (k -3 - ε). Electronic Colloquium on Computational Complexity (ECCC), (027).
7. DINUR, I., GURUSWAMI, V., KHOT, S., AND REGEV, O. 2003. A new multilayered PCP and the hardness of hypergraph vertex cover. In Proceedings of the 35th Annual ACM Symposium on Theory of Computing. ACM, New York, pp. 595-601.
8. DINUR, I., REGEV, O., AND SMYTH, C. D. 2002b. The hardness of 3-uniform hypergraph coloring. In Proceedings of the 43rd IEEE Symposium on Foundations of Computer Science IEEE Computer Society Press, Los Alamitos, Calif.
9. DINUR, I., AND SAFRA, S. 2002. The importance of being biased. In Proceedings of the 34th Annual ACM Symposium on Theory of Computing. ACM, New York, pp. 33-42.
10. DYER, M. E., AND FRIEZE, A. M. 1985. A simple heuristic for the p-center problem. Oper. Res. Lett. 3, 6, 285-288.
11. GAREY, M. R., AND JOHNSON, D. S. 1979. Computers and Intractability: A Guide to the Theory of NP-completeness. Freeman.
12. GOLDREICH, O. 2001. Using the FGLSS-reduction to prove inapproximability results for minimum vertex cover in hypergraphs. Electronic Colloquium on Computational Complexity (ECCC) 102.
13. GONZALEZ, T. F. 1985. Clustering to minimize the maximum intercluster distance. Theoret. Comput. Sci. 38, 2-3, 293-306.
14. HALPERIN, E., KORTSARZ, G., KRAUTHGAMER, R., SRINIVASAN, A., AND WANG, N. 2003. Integrality ratio for group Steiner trees and directed Steiner trees. In Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms. ACM, New York, pp. 275-284.
15. HALPERIN, E., AND KRAUTHGAMER, R. 2003. Polylogarithmic inapproximability. In Proceedings of the 35th Annual ACM Symposium on Theory of Computing. ACM, New York, pp. 585-594.
16. HOCHBAUM, D. S., AND SHMOYS, D. B. 1986. A unified approach to approximation algorithms for bottleneck problems. J. ACM 33, 3, 533-550.
17. HOLMERIN, J. 2002. Vertex cover on 4-regular hypergraphs is hard to approximate within 2 - ε In Proceedings of the 34th ACM Symposium on Theory of Computing. ACM, New York, pp. 544-552.
18. HSU, W. L., AND NEMHAUSER, G. L. 1979. Easy and hard bottleneck location problems. Discr. Appl. Math. 1, 3, 209-215.
19. PANIGRAHY, R., AND VISHWANATHAN, S. 1998. An O(log* n) approximation algorithm for the asymmetric p-center problem. J. Algorithms 27, 2, 259-268.
20. PLESNÍK, J. 1980. On the computational complexity of centers locating in a graph. Aplik. Matem. 25, 6, 445-452.
21. RAZ, R. 1998. A parallel repetition theorem. SIAM J. Comput. 27, 3, 763-803.
22. SHMOYS, D. B. 1995. Computing near-optimal solutions to combinatorial optimization problems. In Combinatorial Optimization, W. Cook, L. Lovasz, and P.D. Seymour, Eds. AMS, pp. 355-397.
23. VAZIRANI, V. V. 2001. Approximation Algorithms. Springer-Verlag, New York.