Research map / Learning theory and algorithms / Combinatorial and search optimization
Two Efficient Local Search Algorithms for Maximum Weight Clique Problem
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| replace CC with strong configuration checking (SCC) (ablation) | LCC local search · DIMACS/BHOSLIB | max clique weight: 34183 -> 34254 (MANN a45) | Helped |
| replace CC with SCC (ablation) | LCC · massive graphs | max clique weight: 1879 -> 1997 (web-wikipedia2009) | Helped |
| add BMS (best from k random swap pairs) instead of best-picking (ablation) | LSCC · massive graphs | max clique weight: 1997 -> 3455 (web-wikipedia2009) | Helped |
| LSCC vs tabu-search MN/TS | MWCP local search · DIMACS | max clique weight: +62 on MANN a45 | Helped |
| LSCC vs MN/TS average weight | MWCP local search · DIMACS C2000.9 | average clique weight: 10948.5 -> 10922.6 | Hurt |
| add BMS to MN/TS | MN/TS · massive graphs | ability to find clique | Helped |
| LSCC+BMS vs MN/TS+BMS | local search · massive graphs | run time on tied instances | Helped |
Closest papers by meaning
- NuQClq: An Effective Local Search Algorithm for Maximum Quasi-Clique Problem (AAAI 2021 · similarity 0.93)
- A Fast Exact Solver with Theoretical Analysis for the Maximum Edge-Weighted Clique Problem (AAAI 2024 · similarity 0.89)
- An Elite-guided Weighted Simulated Annealing Algorithm for the Clique Partitioning Problem (AAAI 2025 · similarity 0.87)
- KD-Club: An Efficient Exact Algorithm with New Coloring-Based Upper Bound for the Maximum k-Defective Clique Problem (AAAI 2024 · similarity 0.87)
- Optimal Quasi-clique: Hardness, Equivalence with Densest-k-Subgraph, and Quasi-partitioned Community Mining (AAAI 2024 · similarity 0.84)
- Differentiable Quadratic Optimization For the Maximum Independent Set Problem (ICML 2025 · similarity 0.83)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.