Publisher
Springer International Publishing
Reference15 articles.
1. Bose, P., Maheshwari, A., Morin, P.: Fast approximations for sums of distances, clustering and the Fermat-Weber problem. Comput. Geom. 24(3), 135–146 (2003)
2. Chang, C.-L.: A lower bound for metric $$1$$-median selection. J. Comput. Syst. Sci. 84, 44–51 (2017)
3. Chang, C.-L.: Metric $$1$$-median selection with fewer queries. In: Proceedings of the 2017 International Conference on Applied System Innovation, pp. 1056–1059 (2017)
4. Chang, C.-L.: Metric $$1$$-median selection: query complexity vs. approximation ratio. ACM Trans. Comput. Theory 9(4), 1–23 (2018). Article 20
5. Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 3rd edn. The MIT Press, Cambridge (2001)