Publication Details
Title: Asymmetric K-Center Is Log* N-Hard to Approximate
Author: J. Chuzhoy, S. Guha, E. Halperin, S. Khanna, G. Kortsarz, R. Krauthgamer, and J. Naor
Group: Algorithms
Date: July 2005
PDF: [Not available online]
Bibliographic Information:
Journal of the ACM, Vol. 52, Issue 4, pp. 538-551
Bibliographic Reference:
J. Chuzhoy, S. Guha, E. Halperin, S. Khanna, G. Kortsarz, R. Krauthgamer, and J. Naor. Asymmetric K-Center Is Log* N-Hard to Approximate. Journal of the ACM, Vol. 52, Issue 4, pp. 538-551, July 2005
Author: J. Chuzhoy, S. Guha, E. Halperin, S. Khanna, G. Kortsarz, R. Krauthgamer, and J. Naor
Group: Algorithms
Date: July 2005
PDF: [Not available online]
Bibliographic Information:
Journal of the ACM, Vol. 52, Issue 4, pp. 538-551
Bibliographic Reference:
J. Chuzhoy, S. Guha, E. Halperin, S. Khanna, G. Kortsarz, R. Krauthgamer, and J. Naor. Asymmetric K-Center Is Log* N-Hard to Approximate. Journal of the ACM, Vol. 52, Issue 4, pp. 538-551, July 2005