Local search: is brute-force avoidable?

DOI10.1016/j.jcss.2011.10.003zbMath1244.68070WikidataQ57359626 ScholiaQ57359626MaRDI QIDQ439931

Michael R. Fellows, Frances A. Rosamond, Fedor V. Fomin, Saket Saurabh, Daniel Lokshtanov, Yngve Villanger

Publication date: 17 August 2012

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcss.2011.10.003

zbMATH Keywords

local search; parameterized complexity; local treewidth

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68R10: Graph theory (including graph drawing) in computer science

68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)

05C85: Graph algorithms (graph-theoretic aspects)