Research map / Learning theory and algorithms / Combinatorial and search optimization
NuQClq: An Effective Local Search Algorithm for Maximum Quasi-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 |
|---|---|---|---|
| use cumulative saturation to break ties instead of random selection (ablation) | NuQClq · all benchmarks | maximum solution size | Helped |
| use BoundedCC instead of DCC (ablation) | NuQClq · all benchmarks | maximum solution size | Helped |
| use BoundedCC instead of SCC (ablation) | NuQClq · all benchmarks | maximum solution size | Helped |
| use the frequency-based initialization instead of restart initialization (ablation) | NuQClq · all benchmarks | maximum solution size | Mixed |
| use BoundedCC instead of DCC (ablation) | NuQClq · graphs with density larger than 80% | solution quality: 6 graphs | Helped |
| cap the configuration-checking threshold and reset it to 1 when it exceeds the bound | BoundedCC · all instances | maximum threshold / average threshold: 6.3 times -> 1.5 times | Helped |
Closest papers by meaning
- A Fast Exact Solver with Theoretical Analysis for the Maximum Edge-Weighted Clique Problem (AAAI 2024 · similarity 0.90)
- KD-Club: An Efficient Exact Algorithm with New Coloring-Based Upper Bound for the Maximum k-Defective Clique Problem (AAAI 2024 · similarity 0.89)
- Optimal Quasi-clique: Hardness, Equivalence with Densest-k-Subgraph, and Quasi-partitioned Community Mining (AAAI 2024 · similarity 0.88)
- An Elite-guided Weighted Simulated Annealing Algorithm for the Clique Partitioning Problem (AAAI 2025 · similarity 0.86)
- Pre-Assignment Problem for Unique Minimum Vertex Cover on Bounded Clique-Width Graphs (AAAI 2025 · similarity 0.86)
- Differentiable Quadratic Optimization For the Maximum Independent Set Problem (ICML 2025 · similarity 0.85)
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.