AI Paper Atlas

Research map / Learning theory and algorithms / Combinatorial and search optimization

NukCP: An Improved Local Search Algorithm for Maximum k-Club Problem

Jiejiang Chen, Yiyuan Wang, Shaowei Cai, Minghao Yin, Yupeng Zhou, Jieyu Wu

AAAI 2022 · Learning theory and algorithms › Combinatorial and search optimization · approach: Heuristic and local search algorithms · 2 citations (OpenAlex)

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (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 changedWhereMeasuredEffect
Use NukCP instead of the strongest reported baselineMaximum k-club search · Random graphs, n300d0.015, k=4maximum club size (family average): 61.4 -> 62.7Improved
Use NukCP instead of VNSMaximum k-club search · DIMACS football, k=3maximum club size: 56 -> 58Improved
Use NukCP instead of VNSMaximum k-club search · DIMACS email, k=3maximum club size: 215 -> 212Hurt
Use NukCP instead of the strongest reported baselineMaximum k-club search · Massive graphs, ca-coauthors-dblp, k=3maximum club size: 4369 -> 7098Improved
Use NukCP instead of the strongest reported baselineMaximum k-club search · Massive graphs, soc-livejournal, k=3maximum club size: 3683 -> 3517Hurt
Use DRM instead of TRIM for initial graph reductionNukCP · Massive graphsreduction runtime (seconds): 844.92 -> 376.43Improved
Use DRM instead of TRIM for initial graph reductionNukCP · Massive graphsreduction ratio: 57.72% -> 58.77%Improved
Replace STCC with DCC (ablation)NukCP · All benchmarksinstances with better results than the variant: 1 better, 1 worse (random graphs); 1 better, 0 worse (DIMACS); 15 better, 4 worse (massive graphs)Mixed
Replace STCC with BoundedCC (ablation)NukCP · All benchmarksinstances with better results than the variant: 1 better, 1 worse (random graphs); 1 better, 0 worse (DIMACS); 18 better, 3 worse (massive graphs)Mixed
Use NukCP instead of VNSMaximum k-club search · Massive graphs, k=2average runtime (seconds): 1288.89 -> 33.82Improved
Increase k to larger valuesNukCP · Massive graphsaverage runtime (seconds): 33.82; 912.61; 2071.4Hurt

Closest papers by meaning

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.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy