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]

@inproceedings{ChuzhoyGHKKN04,
  title = {Asymmetric k-center is log:::*::: ::::n::::-hard to approximate},
  author = {Julia Chuzhoy and Sudipto Guha and Eran Halperin and Sanjeev Khanna and Guy Kortsarz and Joseph Naor},
  year = {2004},
  doi = {10.1145/1007352.1007363},
  url = {http://doi.acm.org/10.1145/1007352.1007363},
  researchr = {https://researchr.org/publication/ChuzhoyGHKKN04},
  cites = {0},
  citedby = {0},
  pages = {21-27},
  booktitle = {Proceedings of the 36th Annual ACM Symposium on Theory of Computing, Chicago, IL, USA, June 13-16, 2004},
  editor = {László Babai},
  publisher = {ACM},
  isbn = {1-58113-852-0},
}