Algorithms for LS Vertex Cover achieve ℓ^{f(k)} n^{O(1)} time for ℓ equal to h-index, treewidth, modular-width, or a new modular-decomposition degree parameter, and extend to weighted d-improving swaps.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Parameterized Local Search for Vertex Cover: When only the Search Radius is Crucial
Algorithms for LS Vertex Cover achieve ℓ^{f(k)} n^{O(1)} time for ℓ equal to h-index, treewidth, modular-width, or a new modular-decomposition degree parameter, and extend to weighted d-improving swaps.