Document Open Access Logo

Connected k-Median with Disjoint and Non-Disjoint Clusters

Authors Jan Eube , Kelin Luo , Dorian Reineccius , Heiko Röglin , Melanie Schmidt

PDF HTML 5

Files

Thumbnail PDF
PDF
LIPIcs.ESA.2025.63.pdf
  • Filesize: 0.74 MB
  • 14 pages
HTML5 Logo HTML (experimental)
LIPIcs.ESA.2025.63.html

Document Identifiers

Related Versions

Subject Classification

ACM Subject Classification
  • Theory of computation → Facility location and clustering
Keywords
  • Clustering
  • Connectivity constraints
  • Approximation algorithms

Metrics

Abstract

The connected k-median problem is a constrained clustering problem that combines distance-based k-clustering with connectivity information. The problem allows to input a metric space and an unweighted undirected connectivity graph that is completely unrelated to the metric space. The goal is to compute k centers and corresponding clusters such that each cluster forms a connected subgraph of G, and such that the k-median cost is minimized.
The problem has applications in very different fields like geodesy (particularly districting), social network analysis (especially community detection), or bioinformatics. We study a version with overlapping clusters where points can be part of multiple clusters which is natural for the use case of community detection. This problem variant is Ω(log n)-hard to approximate, and our main result is an 𝒪(k² log n)-approximation algorithm for the problem. We complement it with an Ω(n^{1-ε})-hardness result for the case of disjoint clusters without overlap with general connectivity graphs, as well as an exact algorithm in this setting if the connectivity graph is a tree.

Cite As Get BibTex

Jan Eube, Kelin Luo, Dorian Reineccius, Heiko Röglin, and Melanie Schmidt. Connected k-Median with Disjoint and Non-Disjoint Clusters. In 33rd Annual European Symposium on Algorithms (ESA 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 351, pp. 63:1-63:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025) https://doi.org/10.4230/LIPIcs.ESA.2025.63

Author Details

Jan Eube
  • University of Bonn, Germany
Kelin Luo
  • University at Buffalo, NY, USA
Dorian Reineccius
  • Deutsches Zentrum für Luft- und Raumfahrt, Bonn, Germany
Heiko Röglin
  • University of Bonn, Germany
Melanie Schmidt
  • Heinrich-Heine Universität Düsseldorf, Germany

Funding

This work has been funded by the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) – 390685813; 459420781 and by the Lamarr Institute for Machine Learning and Artificial Intelligence lamarr-institute.org.

References

  1. Ioana Oriana Bercea, Martin Groß, Samir Khuller, Aounon Kumar, Clemens Rösner, Daniel R. Schmidt, and Melanie Schmidt. On the cost of essentially fair clusterings. In Dimitris Achlioptas and László A. Végh, editors, APPROX/RANDOM 2019, volume 145 of LIPIcs, pages 18:1-18:22. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. URL: https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2019.18.
  2. 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.
  3. 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
  4. Flavio Chierichetti, Ravi Kumar, Silvio Lattanzi, and Sergei Vassilvitskii. Fair clustering through fairlets. Advances in neural information processing systems, 30, 2017. Google Scholar
  5. Erik D Demaine, MohammadTaghi Hajiaghayi, and Philip N Klein. Node-weighted steiner tree and group steiner tree in planar graphs. In International Colloquium on Automata, Languages, and Programming, pages 328-340. Springer, 2009. URL: https://doi.org/10.1007/978-3-642-02927-1_28.
  6. Lukas Drexler, Jan Eube, Kelin Luo, Dorian Reineccius, Heiko Röglin, Melanie Schmidt, and Julian Wargalla. Connected k-center and k-diameter clustering. Algorithmica, September 2024. URL: https://doi.org/10.1007/s00453-024-01266-9.
  7. Jan Eube, Kelin Luo, Dorian Reineccius, Heiko Röglin, and Melanie Schmidt. Connected k-median with disjoint and non-disjoint clusters, 2025. URL: https://arxiv.org/abs/2507.02774.
  8. Rong Ge, Martin Ester, Byron J Gao, Zengjian Hu, Binay Bhattacharya, and Boaz Ben-Moshe. Joint cluster analysis of attribute data and relationship data: The connected k-center problem, algorithms and applications. ACM Transactions on Knowledge Discovery from Data (TKDD), 2(2):1-35, 2008. URL: https://doi.org/10.1145/1376815.1376816.
  9. 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.
  10. Sudipto Guha and Samir Khuller. Greedy strikes back: Improved facility location algorithms. In Howard J. Karloff, editor, Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 25-27 January 1998, San Francisco, California, USA, pages 649-657. ACM/SIAM, 1998. URL: http://dl.acm.org/citation.cfm?id=314613.315037.
  11. Sudipto Guha, Anna Moss, Joseph (Seffi) Naor, and Baruch Schieber. Efficient recovery from power outage (extended abstract). In Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, STOC '99, pages 574-582, New York, NY, USA, 1999. Association for Computing Machinery. URL: https://doi.org/10.1145/301250.301406.
  12. Neelima Gupta, Aditya Pancholi, and Yogish Sabharwal. Clustering with internal connectedness. In WALCOM: Algorithms and Computation: 5th International Workshop, WALCOM 2011, New Delhi, India, February 18-20, 2011. Proceedings 5, pages 158-169. Springer, 2011. URL: https://doi.org/10.1007/978-3-642-19094-0_17.
  13. Dorit S. Hochbaum and David B. Shmoys. A best possible heuristic for the k-center problem. Math. Oper. Res., 10(2):180-184, 1985. URL: https://doi.org/10.1287/moor.10.2.180.
  14. 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.
  15. P. Klein and R. Ravi. A nearly best-possible approximation algorithm for node-weighted steiner trees. Journal of Algorithms, 19(1):104-115, 1995. URL: https://doi.org/10.1006/jagm.1995.1029.
  16. Jochen Könemann, Sina Sadeghian, and Laura Sanita. An lmp o (log n)-approximation algorithm for node weighted prize collecting steiner tree. In 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, pages 568-577. IEEE, 2013. Google Scholar
  17. Shi Li. Approximating capacitated k-median with (1+ε) k open facilities. In Proceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete algorithms, pages 786-796. SIAM, 2016. Google Scholar
  18. Shi Li and Xiangyu Guo. Distributed k-clustering for data with heavy noise. Advances in Neural Information Processing Systems, 31, 2018. Google Scholar
  19. Zhung-Xun Liao and Wen-Chih Peng. Clustering spatial data with a geographic constraint: exploring local search. Knowl. Inf. Syst., 31(1):153-170, 2012. URL: https://doi.org/10.1007/s10115-011-0402-8.
  20. Melanie Schmidt, Chris Schwiegelshohn, and Christian Sohler. Fair coresets and streaming algorithms for fair k-means. In Approximation and Online Algorithms: 17th International Workshop, WAOA 2019, Munich, Germany, September 12-13, 2019, Revised Selected Papers 17, pages 232-251. Springer, 2020. URL: https://doi.org/10.1007/978-3-030-39479-0_16.
  21. Ali Vakilian and Mustafa Yalciner. Improved approximation algorithms for individually fair clustering. In International Conference on Artificial Intelligence and Statistics, pages 8758-8779. PMLR, 2022. Google Scholar
  22. Hamidreza Validi, Austin Buchanan, and Eugene Lykhovyd. Imposing contiguity constraints in political districting models. Oper. Res., 70(2):867-892, 2022. URL: https://doi.org/10.1287/opre.2021.2141.
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