A Note on Metric 1-median Selection
Publisher
Springer Singapore
Reference4 articles.
1. Chang, C.-L.: Metric
$$1$$
-median selection with fewer queries. Technical Report
arXiv: 1612.08654
(2016)
2. Chang, C.-L.: Metric
$$1$$
-median selection: query complexity vs. approximation ratio. ACM Trans. Comput. Theory 9(4), Article 20 (2018)
3. Indyk, P.: Sublinear time algorithms for metric space problems. In: Vitter, J., Larmore, L, Leighton, F. (eds.) The 31st Annual ACM Symposium on Theory of Computing 1999, pp. 428–434. ACM, New York (1999).
https://doi.org/10.1145/301250.301366
4. Indyk, P.: High-dimensional computational geometry. Ph.D. thesis, Stanford University (2000)