Max Clique

Max Clique #

The Maximum Clique problem seeks the largest clique in a graph. A clique is a subset of vertices where every vertex is connected to every other vertex.

Recent Literature #

1. Can Hybrid Geometric Scattering Networks Help Solve the Maximum Clique Problem NeurIPS, 2022. paper, code

   Yimeng Min, Frederik Wenkel, Michael Perlmutter, Guy Wolf

2. Variational Annealing on Graphs for Combinatorial Optimization NeurIPS, 2023. paper, code

   Sanokowski, Sebastian and Berghammer, Wilhelm Franz and Hochreiter, Sepp and Lehner, Sebastian

3. DISCS: A Benchmark for Discrete Sampling NeurIPS, 2023. paper, code

   Katayoon Goshvadi, Haoran Sun, Xingchao Liu, Azade Nova, Ruqi Zhang, Will Sussman Grathwohl, Dale Schuurmans, Hanjun Dai

4. Learning fine-grained search space pruning and heuristics for combinatorial optimization. Journal of Heuristics, 2023. journal

   Juho Lauri, Sourav Dutta, Marco Grassia, Deepak Ajwani

5. A Diffusion Model Framework for Unsupervised Neural Combinatorial Optimization ICML, 2024. paper, code

   Sanokowski, Sebastian and Hochreiter, Sepp and Lehner, Sebastian

6. Scalable Discrete Diffusion Samplers: Combinatorial Optimization and Statistical Physics ICLR, 2025. paper

   Sebastian Sanokowski, Wilhelm Franz Berghammer, Haoyu Peter Wang, Martin Ennemoser, Sepp Hochreiter, Sebastian Lehner

7. Approximation algorithms for combinatorial optimization with predictions ICLR, 2025. paper

   Antonios Antoniadis, Marek Elias, Adam Polak, Moritz Venzin

8. ⭐COExpander: Adaptive Solution Expansion for Combinatorial Optimization ICML, 2025. paper, code

   Jiale Ma and Wenzheng Pan and Yang Li and Junchi Yan

9. ⭐ML4CO-Bench-101: Benchmark Machine Learning for Classic Combinatorial Problems on Graphs NeurIPS, 2025. paper, code

   Jiale Ma and Wenzheng Pan and Yang Li and Junchi Yan