A lower bound for metric 1-median selection
Abstract
Consider the problem of finding a point in an n-point metric space with the minimum average distance to all points. We show that this problem has no deterministic $o(n^2)$-query $(4-\Omega(1))$-approximation algorithms.
- Publication:
-
arXiv e-prints
- Pub Date:
- January 2014
- DOI:
- 10.48550/arXiv.1401.2195
- arXiv:
- arXiv:1401.2195
- Bibcode:
- 2014arXiv1401.2195C
- Keywords:
-
- Computer Science - Data Structures and Algorithms