Asymmetric k-center is log:::*::: ::::n::::-hard to approximate

Julia Chuzhoy, Sudipto Guha, Eran Halperin, Sanjeev Khanna, Guy Kortsarz, Joseph Naor. Asymmetric k-center is log:::*::: ::::n::::-hard to approximate. In László Babai, editor, Proceedings of the 36th Annual ACM Symposium on Theory of Computing, Chicago, IL, USA, June 13-16, 2004. pages 21-27, ACM, 2004. [doi]

Authors

Julia Chuzhoy

This author has not been identified. Look up 'Julia Chuzhoy' in Google

Sudipto Guha

This author has not been identified. Look up 'Sudipto Guha' in Google

Eran Halperin

This author has not been identified. Look up 'Eran Halperin' in Google

Sanjeev Khanna

This author has not been identified. Look up 'Sanjeev Khanna' in Google

Guy Kortsarz

This author has not been identified. Look up 'Guy Kortsarz' in Google

Joseph Naor

This author has not been identified. Look up 'Joseph Naor' in Google