AI Paper Atlas

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

Systematic Exploration of Larger Local Search Neighborhoods for the Minimum Vertex Cover Problem

Maximilian Katzmann, Christian Komusiewicz

AAAI 2017 · Learning theory and algorithms › Combinatorial and search optimization · approach: Heuristic and local search algorithms · 14 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
add pruning rules 1 and 2 to the k-swap search (ablation)k-swap local search for Minimum Vertex Cover · large graphssearch space sizeImproved
add pruning rules to the k-swap search (ablation)k-swap local search for Minimum Vertex Cover · large graphsrunning timeImproved
increase neighborhood radius k up to about 9hill climbing from greedy cover · large graphsrelative improvement over greedy cover: median approximately 5% for k >= 9Improved
start from greedy vertex cover instead of trivial cover (ablation)k-swap hill climbing · benchmark graphsk needed to reach optimumImproved
post-process FastVC solution with k-swap searchFastVC · soc-delicious, tech-RL-caida, citationCiteseervertex cover size: improves by 4, 25, and 9Improved

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