Abstract
Given an n-point metric space (M, d), metric 1-median asks for a point \(p\in M\) minimizing \(\sum _{x\in M}\,d(p,x)\). We show that for each computable function \(f:\mathbb {Z}^+\rightarrow \mathbb {Z}^+\) satisfying \(f(n)=\omega (1)\), metric 1-median has a deterministic, o(n)-query, \(o(f(n)\cdot \log n)\)-approximation and nonadaptive algorithm. Previously, no deterministic o(n)-query o(n)-approximation algorithms are known for metric 1-median.
Supported in part by the Ministry of Science and Technology of Taiwan under grant 109-2221-E-155-031.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
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)
Chang, C.-L.: A lower bound for metric \(1\)-median selection. J. Comput. Syst. Sci. 84, 44–51 (2017)
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)
Chang, C.-L.: Metric \(1\)-median selection: query complexity vs. approximation ratio. ACM Trans. Comput. Theory 9(4), 1–23 (2018). Article 20
Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 3rd edn. The MIT Press, Cambridge (2001)
Eppstein, D., Wang, J.: Fast approximation of centrality. J. Gr. Algorithms Appl. 8(1), 39–45 (2004)
Goldreich, O., Ron, D.: Approximating average parameters of graphs. Random Struct. Algorithms 32(4), 473–493 (2008)
Guha, S., Meyerson, A., Mishra, N., Motwani, R., O’Callaghan, L.: Clustering data streams: theory and practice. IEEE Trans. Knowl. Data Eng. 15(3), 515–528 (2003)
Indyk, P.: Sublinear time algorithms for metric space problems. In: Proceedings of the 31st Annual ACM Symposium on Theory of Computing, pp. 428–434 (1999)
Indyk, P.: High-dimensional computational geometry. PhD thesis, Stanford University (2000)
Jain, K., Mahdian, M., Saberi, A.: A new greedy approach for facility location problems. In: Proceedings of the Thiry-Fourth Annual ACM Symposium on Theory of Computing, pp. 731–740 (2002)
Kumar, A., Sabharwal, Y., Sen, S.: Linear-time approximation schemes for clustering problems in any dimensions. J. ACM 57(2), 5 (2010)
Rudin, W.: Principles of Mathematical Analysis, 3rd edn. McGraw-Hill, New York (1976)
Wasserman, S., Faust, K.: Social Network Analysis: Methods and Applications. Cambridge University Press, Cambridge (1994)
Wu, B.Y.: On approximating metric \(1\)-median in sublinear time. Inf. Process. Lett. 114(4), 163–166 (2014)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 Springer Nature Switzerland AG
About this paper
Cite this paper
Chang, CL. (2021). Deterministic Metric 1-median Selection with a \(1-o(1)\) Fraction of Points Ignored. In: Chen, CY., Hon, WK., Hung, LJ., Lee, CW. (eds) Computing and Combinatorics. COCOON 2021. Lecture Notes in Computer Science(), vol 13025. Springer, Cham. https://doi.org/10.1007/978-3-030-89543-3_18
Download citation
DOI: https://doi.org/10.1007/978-3-030-89543-3_18
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-89542-6
Online ISBN: 978-3-030-89543-3
eBook Packages: Computer ScienceComputer Science (R0)