Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
125 tokens/sec
GPT-4o
47 tokens/sec
Gemini 2.5 Pro Pro
43 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Parameterized Algorithms for Balanced Cluster Edge Modification Problems (2403.03830v2)

Published 6 Mar 2024 in cs.DS and cs.DM

Abstract: We study {\sc Cluster Edge Modification} problems with constraints on the size of the clusters. A graph $G$ is a cluster graph if every connected component of $G$ is a clique. In a typical {\sc Cluster Edge Modification} problem such as the widely studied {\sc Cluster Editing}, we are given a graph $G$ and a non-negative integer $k$ as input, and we have to decide if we can turn $G$ into a cluster graph by way of at most $k$ edge modifications -- that is, by adding or deleting edges. In this paper, we study the parameterized complexity of such problems, but with an additional constraint: The size difference between any two connected components of the resulting cluster graph should not exceed a given threshold. Depending on which modifications are permissible -- only adding edges, only deleting edges, both adding and deleting edges -- we have three different computational problems. We show that all three problems, when parameterized by $k$, admit single-exponential time FPT algorithms and polynomial kernels. Our problems may be thought of as the size-constrained or balanced counterparts of the typical {\sc Cluster Edge Modification} problems, similar to the well-studied size-constrained or balanced counterparts of other clustering problems such as {\sc $k$-Means Clustering}.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (56)
  1. Faisal N. Abu-Khzam. On the complexity of multi-parameterized cluster editing. J. Discrete Algorithms, 45:26–34, 2017.
  2. Clustering what matters: Optimal approximation for clustering with outliers. In AAAI, pages 6666–6674. AAAI Press, 2023.
  3. Aggregating inconsistent information: Ranking and clustering. J. ACM, 55(5):23:1–23:27, 2008.
  4. Balanced clustering for content-based image browsing. In Informatiktage, pages 27–30, 2011.
  5. A tight approximation algorithm for the cluster vertex deletion problem. Math. Program., 197(2):1069–1091, 2023.
  6. Lossy kernelization of same-size clustering. Theory Comput. Syst., 67(4):785–824, 2023.
  7. Correlation clustering. Mach. Learn., 56(1-3):89–113, 2004.
  8. Clustering gene expression patterns. J. Comput. Biol., 6(3/4):281–297, 1999.
  9. Sebastian Böcker. A golden ratio parameterized algorithm for cluster editing. J. Discrete Algorithms, 16:79–89, 2012.
  10. Cluster editing. In CiE, volume 7921 of Lecture Notes in Computer Science, pages 33–44. Springer, 2013.
  11. A fixed-parameter approach for weighted cluster editing. In APBC, volume 6 of Advances in Bioinformatics and Computational Biology, pages 211–220. Imperial College Press, 2008.
  12. Exact algorithms for cluster editing: Evaluation and experiments. Algorithmica, 60(2):316–334, 2011.
  13. Constrained k-means clustering. Microsoft Research, Redmond, 20(0):0, 2000.
  14. Cluster editing: Kernelization based on edge cuts. In IPEC, volume 6478 of Lecture Notes in Computer Science, pages 60–71. Springer, 2010.
  15. Clustering with qualitative information. J. Comput. Syst. Sci., 71(3):360–383, 2005.
  16. A 2k kernel for the cluster editing problem. J. Comput. Syst. Sci., 78(1):211–220, 2012.
  17. A survey of parameterized algorithms and the complexity of edge modification. Comput. Sci. Rev., 48:100556, 2023.
  18. Parameterized Algorithms. Springer, 2015.
  19. Exact and approximate bandwidth. Theor. Comput. Sci., 411(40-42):3701–3713, 2010.
  20. A comprehensive survey of clustering algorithms: State-of-the-art machine learning applications, taxonomy, challenges, and future research prospects. Eng. Appl. Artif. Intell., 110:104743, 2022.
  21. Michael R. Fellows. The lost continent of polynomial time: Preprocessing and kernelization. In IWPEC, volume 4169 of Lecture Notes in Computer Science, pages 276–277. Springer, 2006.
  22. Efficient parameterized preprocessing for cluster editing. In FCT, volume 4639 of Lecture Notes in Computer Science, pages 312–321. Springer, 2007.
  23. Parameterized complexity of categorical clustering with size constraints. J. Comput. Syst. Sci., 136:171–194, 2023.
  24. Tight bounds for parameterized complexity of cluster editing with a small number of clusters. J. Comput. Syst. Sci., 80(7):1430–1447, 2014.
  25. Finding cliques in social networks: A new distribution-free model. SIAM J. Comput., 49(2):448–464, 2020.
  26. Modification-fair cluster editing. In AAAI, pages 6631–6638. AAAI Press, 2022.
  27. Complexity results for multiprocessor scheduling under resource constraints. SIAM J. Comput., 4(4):397–411, 1975.
  28. Automated generation of search tree algorithms for hard graph modification problems. Algorithmica, 39(4):321–347, 2004.
  29. Graph-modeled data clustering: Exact algorithms for clique generation. Theory Comput. Syst., 38(4):373–392, 2005.
  30. Jiong Guo. A more effective linear kernelization for cluster editing. Theor. Comput. Sci., 410(8-10):718–726, 2009.
  31. Improved algorithms for bicluster editing. In TAMC, volume 4978 of Lecture Notes in Computer Science, pages 445–456. Springer, 2008.
  32. A more relaxed model for graph-based data clustering: s-plex cluster editing. SIAM J. Discret. Math., 24(4):1662–1683, 2010.
  33. Even more effort towards improved bounds and fixed-parameter tractability for multiwinner rules. In IJCAI, pages 217–223. ijcai.org, 2021.
  34. (1,1)-cluster editing is polynomial-time solvable. Discret. Appl. Math., 340:259–271, 2023.
  35. New spectral methods for ratio cut partitioning and clustering. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 11(9):1074–1085, 1992.
  36. Asymptotic formulaæ in combinatory analysis. Proceedings of the London Mathematical Society, 2(1):75–115, 1918.
  37. The PACE 2021 parameterized algorithms and computational experiments challenge: Cluster editing. In IPEC, volume 214 of LIPIcs, pages 26:1–26:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021.
  38. Donald E. Knuth. The Art of Computer Programming, Volume 4A: Combinatorial Algorithms, Part 1. Pearson Education, 2014.
  39. Exploiting $c$-closure in kernelization algorithms for graph problems. SIAM J. Discret. Math., 36(4):2798–2821, 2022.
  40. Cluster editing with locally bounded modifications. Discret. Appl. Math., 160(15):2259–2270, 2012.
  41. Generalized assignment problem. In Encyclopedia of Optimization, pages 1153–1162. Springer, 2009.
  42. Load-balanced clustering algorithm with distributed self-organization for wireless sensor networks. IEEE sensors journal, 13(5):1498–1506, 2012.
  43. Balanced clustering: A uniform model and fast algorithm. In IJCAI, pages 2987–2993. ijcai.org, 2019.
  44. Clustering with local restrictions. Inf. Comput., 222:278–292, 2013.
  45. Balanced k-means for clustering. In S+SSPR, volume 8621 of Lecture Notes in Computer Science, pages 32–41. Springer, 2014.
  46. Robert T. Moenck. Practical fast polynomial multiplication. In SYMSACC, pages 136–148. ACM, 1976.
  47. clustermaker: a multi-algorithm clustering plugin for cytoscape. BMC bioinformatics, 12(1):1–14, 2011.
  48. Applying modular decomposition to parameterized cluster editing problems. Theory Comput. Syst., 44(1):91–104, 2009.
  49. Cluster graph modification problems. Discret. Appl. Math., 144(1-2):173–182, 2004.
  50. An energy-balanced clustering routing algorithm for wireless sensor network. Wireless Sensor Network, 2(10):777, 2010.
  51. Dekel Tsur. Faster parameterized algorithm for cluster vertex deletion. Theory Comput. Syst., 65(2):323–343, 2021.
  52. Vijay V. Vazirani. Approximation algorithms. Springer, 2001.
  53. The Design of Approximation Algorithms. Cambridge University Press, 2011.
  54. Partitioning biological data with transitivity clustering. Nature methods, 7(6):419–420, 2010.
  55. A simple and improved parameterized algorithm for bicluster editing. Inf. Process. Lett., 174:106193, 2022.
  56. A comprehensive survey of clustering algorithms. Annals of Data Science, 2:165–193, 2015.
Citations (1)
View on Semantic Scholar

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now