Document Open Access Logo

Deterministic k-Median Clustering in Near-Optimal Time

Authors Martín Costa , Ermiya Farokhnejad

PDF HTML 5

Files

Thumbnail PDF
PDF
LIPIcs.ICALP.2025.62.pdf
  • Filesize: 1.37 MB
  • 20 pages
HTML5 Logo HTML (experimental)
LIPIcs.ICALP.2025.62.html

Document Identifiers

Related Versions

Subject Classification

ACM Subject Classification
  • Theory of computation → Facility location and clustering
Keywords
  • k-clustering
  • k-median
  • deterministic algorithms
  • approximation algorithms

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Abstract

The metric k-median problem is a textbook clustering problem. As input, we are given a metric space V of size n and an integer k, and our task is to find a subset S ⊆ V of at most k "centers" that minimizes the total distance from each point in V to its nearest center in S.
Mettu and Plaxton [UAI'02] gave a randomized algorithm for k-median that computes a O(1)-approximation in Õ(nk) time. They also showed that any algorithm for this problem with a bounded approximation ratio must have a running time of Ω(nk). Thus, the running time of their algorithm is optimal up to polylogarithmic factors.
For deterministic k-median, Guha et al. [FOCS'00] gave an algorithm that computes a poly(log (n/k))-approximation in Õ(nk) time, where the degree of the polynomial in the approximation is unspecified. To the best of our knowledge, this remains the state-of-the-art approximation of any deterministic k-median algorithm with this running time. 
This leads us to the following natural question: What is the best approximation of a deterministic k-median algorithm with near-optimal running time? We make progress in answering this question by giving a deterministic algorithm that computes a O(log(n/k))-approximation in Õ(nk) time. We also provide a lower bound showing that any deterministic algorithm with this running time must have an approximation ratio of Ω(log n/(log k + log log n)), establishing a gap between the randomized and deterministic settings for k-median.

Cite As Get BibTex

Martín Costa and Ermiya Farokhnejad. Deterministic k-Median Clustering in Near-Optimal Time. In 52nd International Colloquium on Automata, Languages, and Programming (ICALP 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 334, pp. 62:1-62:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025) https://doi.org/10.4230/LIPIcs.ICALP.2025.62

Author Details

Martín Costa
  • University of Warwick, Coventry, UK
Ermiya Farokhnejad
  • University of Warwick, Coventry, UK

Funding

  • Costa, Martín: Supported by a Google PhD Fellowship.

References

  1. Sara Ahmadian, Ashkan Norouzi-Fard, Ola Svensson, and Justin Ward. Better guarantees for k-means and euclidean k-median by primal-dual algorithms. SIAM Journal on Computing, 49(4):FOCS17-97, 2019. URL: https://doi.org/10.1137/18M1171321.
  2. Nir Ailon, Ragesh Jaiswal, and Claire Monteleoni. Streaming k-means approximation. Advances in neural information processing systems, 22, 2009. Google Scholar
  3. Vijay Arya, Naveen Garg, Rohit Khandekar, Adam Meyerson, Kamesh Munagala, and Vinayaka Pandit. Local search heuristics for k-median and facility location problems. SIAM J. Comput., 33(3):544-562, 2004. URL: https://doi.org/10.1137/S0097539702416402.
  4. Sepehr Assadi, Andrew Chen, and Glenn Sun. Deterministic graph coloring in the streaming model. In Stefano Leonardi and Anupam Gupta, editors, STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20 - 24, 2022, pages 261-274. ACM, 2022. URL: https://doi.org/10.1145/3519935.3520016.
  5. MohammadHossein Bateni, Hossein Esfandiari, Hendrik Fichtenberger, Monika Henzinger, Rajesh Jayaram, Vahab Mirrokni, and Andreas Wiese. Optimal fully dynamic k-center clustering for adaptive and oblivious adversaries. In Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 2677-2727. SIAM, 2023. URL: https://doi.org/10.1137/1.9781611977554.CH101.
  6. Sayan Bhattacharya, Martín Costa, and Ermiya Farokhnejad. Fully dynamic k-median with near-optimal update time and recourse. In 57th Annual ACM SIGACT Symposium on Theory of Computing (STOC), 2025. (To Appear). Google Scholar
  7. Sayan Bhattacharya, Martín Costa, Naveen Garg, Silvio Lattanzi, and Nikos Parotsidis. Fully dynamic k-clustering with fast update time and small recourse. In 65th IEEE Symposium on Foundations of Computer Science (FOCS), 2024. Google Scholar
  8. Sayan Bhattacharya, Martín Costa, Silvio Lattanzi, and Nikos Parotsidis. Fully dynamic k-clustering in Õ(k) update time. In Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, NeurIPS 2023, New Orleans, LA, USA, December 10 - 16, 2023, 2023. Google Scholar
  9. Jarosław Byrka, Thomas Pensyl, Bartosz Rybicki, Aravind Srinivasan, and Khoa Trinh. An improved approximation for k-median and positive correlation in budgeted optimization. ACM Transactions on Algorithms (TALG), 13(2):1-31, 2017. URL: https://doi.org/10.1145/2981561.
  10. Ching-Lueh Chang. Metric 1-median selection: Query complexity vs. approximation ratio. In 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. URL: https://doi.org/10.1007/978-3-319-42634-1_11.
  11. Moses Charikar, Sudipto Guha, Éva Tardos, and David B Shmoys. A constant-factor approximation algorithm for the k-median problem. In Proceedings of the thirty-first annual ACM symposium on Theory of computing, pages 1-10, 1999. Google Scholar
  12. Moses Charikar, Liadan O'Callaghan, and Rina Panigrahy. Better streaming algorithms for clustering problems. In Proceedings of the thirty-fifth annual ACM symposium on Theory of computing, pages 30-39, 2003. URL: https://doi.org/10.1145/780542.780548.
  13. Marek Chrobak, Claire Kenyon, and Neal E. Young. The reverse greedy algorithm for the metric k-median problem. Inf. Process. Lett., 97(2):68-72, 2006. URL: https://doi.org/10.1016/J.IPL.2005.09.009.
  14. Vincent Cohen-Addad, Niklas Hjuler, Nikos Parotsidis, David Saulpic, and Chris Schwiegelshohn. Fully dynamic consistent facility location. In Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, NeurIPS 2019, December 8-14, 2019, Vancouver, BC, Canada, pages 3250-3260, 2019. URL: https://proceedings.neurips.cc/paper/2019/hash/fface8385abbf94b4593a0ed53a0c70f-Abstract.html.
  15. Vincent Cohen-Addad, David Saulpic, and Chris Schwiegelshohn. Deterministic clustering in high dimensional spaces: Sketches and approximation. In 64th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2023, Santa Cruz, CA, USA, November 6-9, 2023, pages 1105-1130. IEEE, 2023. URL: https://doi.org/10.1109/FOCS57990.2023.00066.
  16. Martín Costa and Ermiya Farokhnejad. Deterministic k-median clustering in near-optimal time, 2025. URL: https://arxiv.org/abs/2504.15115.
  17. Max Dupré la Tour, Monika Henzinger, and David Saulpic. Fully dynamic k-means coreset in near-optimal update time. In 32nd Annual European Symposium on Algorithms, ESA 2024, volume 308 of LIPIcs, pages 100:1-100:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. URL: https://doi.org/10.4230/LIPICS.ESA.2024.100.
  18. Max Dupré la Tour and David Saulpic. Almost-linear time approximation algorithm to euclidean k-median and k-means. CoRR, abs/2407.11217, 2024. URL: https://doi.org/10.48550/arXiv.2407.11217.
  19. Teofilo F. Gonzalez. Clustering to minimize the maximum intercluster distance. Theor. Comput. Sci., 38:293-306, 1985. URL: https://doi.org/10.1016/0304-3975(85)90224-5.
  20. Sudipto Guha, Nina Mishra, Rajeev Motwani, and Liadan O'Callaghan. Clustering data streams. In 41st Annual Symposium on Foundations of Computer Science, FOCS 2000, 12-14 November 2000, Redondo Beach, California, USA, pages 359-366. IEEE Computer Society, 2000. URL: https://doi.org/10.1109/SFCS.2000.892124.
  21. Anupam Gupta and Kanat Tangwongsan. Simpler analyses of local search algorithms for facility location. CoRR, abs/0809.2554, 2008. URL: https://arxiv.org/abs/0809.2554.
  22. Bernhard Haeupler, Yaowei Long, and Thatchaphol Saranurak. Dynamic deterministic constant-approximate distance oracles with n^ε worst-case update time. In 65th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2024, Chicago, IL, USA, October 27-30, 2024, pages 2033-2044. IEEE, 2024. URL: https://doi.org/10.1109/FOCS61266.2024.00121.
  23. M. Henzinger and S. Kale. Fully-dynamic coresets. In ESA, 2020. Google Scholar
  24. Monika Henzinger, Jason Li, Satish Rao, and Di Wang. Deterministic near-linear time minimum cut in weighted graphs. In Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, SODA 2024, Alexandria, VA, USA, January 7-10, 2024, pages 3089-3139. SIAM, 2024. URL: https://doi.org/10.1137/1.9781611977912.111.
  25. Wen-Lian Hsu and George L. Nemhauser. Easy and hard bottleneck location problems. Discret. Appl. Math., 1(3):209-215, 1979. URL: https://doi.org/10.1016/0166-218X(79)90044-1.
  26. Kamal Jain and Vijay V Vazirani. Approximation algorithms for metric facility location and k-median problems using the primal-dual schema and lagrangian relaxation. Journal of the ACM (JACM), 48(2):274-296, 2001. URL: https://doi.org/10.1145/375827.375845.
  27. Ramgopal R. Mettu and C. Greg Plaxton. The online median problem. In 41st Annual Symposium on Foundations of Computer Science (FOCS), pages 339-348, 2000. URL: https://doi.org/10.1109/SFCS.2000.892122.
  28. Ramgopal R. Mettu and C. Greg Plaxton. Optimal time bounds for approximate clustering. In Proceedings of the 18th Conference in Uncertainty in Artificial Intelligence (UAI), pages 344-351, 2002. URL: https://dslpitt.org/uai/displayArticleDetails.jsp?mmnu=1&smnu=2&article_id=878&proceeding_id=18.
  29. Sagnik Mukhopadhyay and Danupon Nanongkai. Weighted min-cut: sequential, cut-query, and streaming algorithms. In Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, STOC 2020, Chicago, IL, USA, June 22-26, 2020, pages 496-509. ACM, 2020. URL: https://doi.org/10.1145/3357713.3384334.
  30. Ofer Neiman and Shay Solomon. Simple deterministic algorithms for fully dynamic maximal matching. ACM Trans. Algorithms, 12(1):7:1-7:15, 2016. URL: https://doi.org/10.1145/2700206.
Any Issues?
X

Feedback on the Current Page

CAPTCHA

Thanks for your feedback!

Feedback submitted to Dagstuhl Publishing

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact