Metric 1-Median Selection: Query Complexity vs. Approximation Ratio

Ching-Lueh Chang. Metric 1-Median Selection: Query Complexity vs. Approximation Ratio. In Thang N. Dinh, My T. Thai, editors, Computing and Combinatorics - 22nd International Conference, COCOON 2016, Ho Chi Minh City, Vietnam, August 2-4, 2016, Proceedings. Volume 9797 of Lecture Notes in Computer Science, pages 131-142, Springer, 2016. [doi]

@inproceedings{Chang16-15,
  title = {Metric 1-Median Selection: Query Complexity vs. Approximation Ratio},
  author = {Ching-Lueh Chang},
  year = {2016},
  doi = {10.1007/978-3-319-42634-1_11},
  url = {http://dx.doi.org/10.1007/978-3-319-42634-1_11},
  researchr = {https://researchr.org/publication/Chang16-15},
  cites = {0},
  citedby = {0},
  pages = {131-142},
  booktitle = {Computing and Combinatorics - 22nd International Conference, COCOON 2016, Ho Chi Minh City, Vietnam, August 2-4, 2016, Proceedings},
  editor = {Thang N. Dinh and My T. Thai},
  volume = {9797},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-319-42633-4},
}