Skip to main content

Advertisement

Springer Nature Link
Log in

Improving local search algorithms for clique relaxation problems via group driven initialization

  • Research Article
  • Published:
Frontiers of Computer Science Aims and scope Submit manuscript

Abstract

Clique relaxation problems are important extension versions of the maximum clique problem with extensive real-world applications. Although lots of studies focus on designing local search algorithms for solving these problems, almost all state-of-the-art local search algorithms adopt a common general initialization method. This paper develops a general group driven initialization method for clique relaxation problems. The proposed method uses two kinds of ways to divide vertices into some subgroups by using the useful information of the search procedure and the structure information of a given instance and then constructs a good initial solution by considering the generated group information. We apply the proposed initialization method to two clique relaxation problems. Experimental results demonstrate that the proposed initialization method clearly improves the performance of state-of-the-art algorithms for the clique relaxation problems.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Malod-Dognin N, Andonov R, Yanev N. Maximum cliques in protein structure comparison. In: Proceedings of the 9th International Symposium on Experimental Algorithms. 2010, 106–117

    Google Scholar 

  2. Hao J K. Memetic algorithms in discrete optimization. In: Neri F, Cotta C, Moscato P, eds. Handbook of Memetic Algorithms. Berlin: Springer, 2012, 73–94

    Chapter  Google Scholar 

  3. Alduaiji N, Datta A, Li J. Influence propagation model for clique-based community detection in social networks. IEEE Transactions on Computational Social Systems, 2018, 5(2): 563–575

    Article  Google Scholar 

  4. Ouyang G, Dey D K, Zhang P. Clique-based method for social network clustering. Journal of Classification, 2020, 37(1): 254–274

    Article  MathSciNet  Google Scholar 

  5. Shahinpour S, Butenko S. Algorithms for the maximum k-club problem in graphs. Journal of Combinatorial Optimization, 2013, 26(3): 520–554

    Article  MathSciNet  Google Scholar 

  6. Jiang H, Xu F, Zheng Z, Wang B, Zhou W. A refined upper bound and inprocessing for the maximum k-plex problem. In: Proceedings of the 32nd International Joint Conference on Artificial Intelligence. 2023, 5613–5621

    Google Scholar 

  7. Chen J, Cai S, Pan S, Wang Y, Lin Q, Zhao M, Yin M. NuQClq: An effective local search algorithm for maximum quasi-clique problem. In: Proceedings of the 35th AAAI Conference on Artificial Intelligence. 2021, 12258–12266

    Google Scholar 

  8. Gao J, Xu Z, Li R, Yin M. An exact algorithm with new upper bounds for the maximum k-defective clique problem in massive sparse graphs. In: Proceedings of the 36th AAAI Conference on Artificial Intelligence. 2022, 10174–10183

    Google Scholar 

  9. Balasundaram B. Graph theoretic generalizations of clique: optimization and extensions. Texas A&M University, Dissertation, 2007

    Google Scholar 

  10. Kempe D, Kleinberg J, Tardos É. Maximizing the spread of influence through a social network. In: Proceedings of the 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. 2003, 137–146

    Google Scholar 

  11. Terveen L, Hill W, Amento B. Constructing, organizing, and visualizing collections of topically related web resources. ACM Transactions on Computer-Human Interaction, 1999, 6(1): 67–94

    Article  Google Scholar 

  12. Yu H, Paccanaro A, Trifonov V, Gerstein M. Predicting interactions in protein networks by completing defective cliques. Bioinformatics, 2006, 22(7): 823–829

    Article  Google Scholar 

  13. Bandyopadhyay S, Bhattacharyya M. Mining the largest quasi-clique in human protein interactome. Nature Precedings, 2012

    Google Scholar 

  14. Yannakakis M. Node- and edge-deletion NP-complete problems. In: Proceedings of the 10th Annual ACM Symposium on Theory of Computing. 1978, 253–264

    Google Scholar 

  15. Bourjolly J M, Laporte G, Pesant G. An exact algorithm for the maximum k-club problem in an undirected graph. European Journal of Operational Research, 2002, 138(1): 21–28

    Article  MathSciNet  Google Scholar 

  16. Balasundaram B, Butenko S, Hicks I V. Clique relaxations in social network analysis: the maximum k-plex problem. Operations Research, 2011, 59(1): 133–142

    Article  MathSciNet  Google Scholar 

  17. Pattillo J, Veremyev A, Butenko S, Boginski V. On the maximum quasi-clique problem. Discrete Applied Mathematics, 2013, 161(1–2): 244–257

    Article  MathSciNet  Google Scholar 

  18. Peng Y, Xu Y, Zhao H, Zhou Z, Han H. Most similar maximal clique query on large graphs. Frontiers of Computer Science, 2020, 14(3): 143601

    Article  Google Scholar 

  19. Wang Z, Zhou Y, Luo C, Xiao M. A fast maximum k-plex algorithm parameterized by the degeneracy gap. In: Proceedings of the 32nd International Joint Conference on Artificial Intelligence. 2023, 5648–5656

    Google Scholar 

  20. Miao Z, Balasundaram B. An ellipsoidal bounding scheme for the quasi-clique number of a graph. INFORMS Journal on Computing, 2020, 32(3): 763–778

    Article  MathSciNet  Google Scholar 

  21. Daemi N, Borrero J S, Balasundaram B. Interdicting low-diameter cohesive subgroups in large-scale social networks. INFORMS Journal on Optimization, 2022, 4(3): 304–325

    Article  MathSciNet  Google Scholar 

  22. Almeida M T, Carvalho F D. Two-phase heuristics for the k-club problem. Computers & Operations Research, 2014, 52: 94–104

    Article  MathSciNet  Google Scholar 

  23. Moradi E, Balasundaram B. Finding a maximum k-club using the k-clique formulation and canonical hypercube cuts. Optimization Letters, 2018, 12(8): 1947–1957

    Article  MathSciNet  Google Scholar 

  24. Chen J, Wang Y, Cai S, Yin M, Zhou Y, Wu J. NukCP: an improved local search algorithm for maximum k-club problem. In: Proceedings of the 36th AAAI Conference on Artificial Intelligence. 2022, 10146–10155

    Google Scholar 

  25. Zhou Y, Hao J K. Frequency-driven tabu search for the maximum s-plex problem. Computers & Operations Research, 2017, 86: 65–78

    Article  MathSciNet  Google Scholar 

  26. Chen P, Wan H, Cai S, Li J, Chen H. Local search with dynamic-threshold configuration checking and incremental neighborhood updating for maximum k-plex problem. In: Proceedings of the 34th AAAI Conference on Artificial Intelligence. 2020, 2343–2350

    Google Scholar 

  27. Pullan W. Local search for the maximum k-plex problem. Journal of Heuristics, 2021, 27(3): 303–324

    Article  MathSciNet  Google Scholar 

  28. Jin Y, Drake J H, He K, Benlic U. Reinforcement learning based coarse-to-fine search for the maximum k-plex problem. Applied Soft Computing, 2022, 131: 109758

    Article  Google Scholar 

  29. Djeddi Y, Haddadene H A, Belacel N. An extension of adaptive multistart tabu search for the maximum quasi-clique problem. Computers & Industrial Engineering, 2019, 132: 280–292

    Article  Google Scholar 

  30. Zhou Q, Benlic U, Wu Q. An opposition-based memetic algorithm for the maximum quasi-clique problem. European Journal of Operational Research, 2020, 286(1): 63–83

    Article  MathSciNet  Google Scholar 

  31. Pinto B Q, Ribeiro C C, Riveaux J A, Rosseti I. A BRKGA-based matheuristic for the maximum quasi-clique problem with an exact local search strategy. RAIRO-Operations Research, 2021, 55: S741–S763

    Article  MathSciNet  Google Scholar 

  32. Lipowski A, Lipowska D. Roulette-wheel selection via stochastic acceptance. Physica A: Statistical Mechanics and Its Applications, 2012, 391(6): 2193–2196

    Article  Google Scholar 

  33. Wu Q, Hao J K. A review on algorithms for maximum clique problems. European Journal of Operational Research, 2015, 242(3): 693–709

    Article  MathSciNet  Google Scholar 

  34. Cai S, Lin J, Luo C. Finding a small vertex cover in massive sparse graphs: construct, local search, and preprocess. Journal of Artificial Intelligence Research, 2017, 59: 463–494

    Article  MathSciNet  Google Scholar 

  35. Newman M E J, Girvan M. Finding and evaluating community structure in networks. Physical Review E, 2004, 69(2): 026113

    Article  Google Scholar 

  36. Blondel V D, Guillaume J L, Lambiotte R, Lefebvre E. Fast unfolding of communities in large networks. Journal of Statistical Mechanics: Theory and Experiment, 2008, 2008(10): P10008

    Article  Google Scholar 

  37. López-Ibáñez M, Dubois-Lacoste J, Cáceres L P, Birattari M, Stützle T. The irace package: iterated racing for automatic algorithm configuration. Operations Research Perspectives, 2016, 3: 43–58

    Article  MathSciNet  Google Scholar 

  38. Johnson D S, Trick M A. Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, Workshop, October 11–13, 1993. Boston: American Mathematical Society, 1996

    Book  Google Scholar 

  39. Xu K, Boussemart F, Hemery F, Lecoutre C. Random constraint satisfaction: Easy generation of hard (satisfiable) instances. Artificial Intelligence, 2007, 171(8–9): 514–534

    Article  MathSciNet  Google Scholar 

  40. Davis T A, Hu Y. The university of Florida sparse matrix collection. ACM Transactions on Mathematical Software, 2011, 38(1): 1

    MathSciNet  Google Scholar 

  41. Rossi R A, Ahmed N K. The network data repository with interactive graph analytics and visualization. In: Proceedings of the 29th AAAI Conference on Artificial Intelligence. 2015, 4292–4293

    Google Scholar 

  42. Wang Y, Cai S, Chen J, Yin M. SCCWalk: an efficient local search algorithm and its improvements for maximum weight clique problem. Artificial Intelligence, 2020, 280: 103230

    Article  MathSciNet  Google Scholar 

  43. Jiang L, Ouyang D, Zhang Q, Zhang L. DeciLS-PBO: an effective local search method for pseudo-Boolean optimization. Frontiers of Computer Science, 2024, 18(2): 182326

    Article  Google Scholar 

  44. Pan S, Ma Y, Wang Y, Zhou Z, Ji J, Yin M, Hu S. An improved master-apprentice evolutionary algorithm for minimum independent dominating set problem. Frontiers of Computer Science, 2023, 17(4): 174326

    Article  Google Scholar 

Download references

Acknowledgement

This work was supported by the National Natural Science Foundation of China (Grant Nos. 61806050, 61976050), CCF Huawei Hu Yanglin Foundation Theoretical Computer Science Project (CCF-HuaweiLK2023001), the Fundamental Research Funds for the Central Universities (2412022ZD015, 2412023YQ003), and Jilin Science and Technology Department (YDZJ202201ZYTS412, 20240602005RC).

Author information

Authors and Affiliations

  1. School of Computer Science and Information Technology, Northeast Normal University, Changchun, 130117, China

    Rui Sun, Yiyuan Wang & Minghao Yin

  2. Key Laboratory of Applied Statistics of Ministry of Education, Northeast Normal University, Changchun, 130117, China

    Rui Sun, Yiyuan Wang & Minghao Yin

Authors
  1. Rui Sun
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Yiyuan Wang
    View author publications

    You can also search for this author inPubMed Google Scholar

  3. Minghao Yin
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding authors

Correspondence to Yiyuan Wang or Minghao Yin.

Ethics declarations

Competing interests The authors declare that they have no competing interests or financial conflicts to disclose.

Additional information

Rui Sun received the BS and MS degrees from the Software College, Jilin University, China in 2019 and 2022, respectively. His current research interests include local search, combinatorial optimization, propositional satisfiability problems.

Yiyuan Wang is an associate professor at School of Computer Science and Information Technology, Northeast Normal University, China. He received his PhD degree from Jilin University, China. His research interests include heuristic search, local search, algorithmic design, combinatorial optimization.

Minghao Yin is a professor at School of Computer Science and Information Technology, Northeast Normal University, China. He received his PhD degree in Computer Software and Theory from Jilin University, China. His research interests include heuristic search, data mining, and combinatorial optimization.

Electronic supplementary material

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Sun, R., Wang, Y. & Yin, M. Improving local search algorithms for clique relaxation problems via group driven initialization. Front. Comput. Sci. 19, 196403 (2025). https://doi.org/10.1007/s11704-024-40238-8

Download citation

  • Received:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1007/s11704-024-40238-8

Keywords