Exact algorithms via monotone local search

DOI10.1145/2897518.2897551MaRDI QIDQ6829798zbMATH OpenFDO

Authors Fedor V. Fomin, Serge Gaspers, Daniel Lokshtanov, Saket Saurabh

Publication date 29 September 2017

Published in Proceedings of the forty-eighth annual ACM symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/2897518.2897551

zbMATH Keywords

combinatorial boundsexponential time algorithmsparameterized algorithmsrandomized algorithmssubset problems

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Nonnumerical algorithms (68W05) Randomized algorithms (68W20)

Cited in

(1)

• Improved parameterized algorithms for cluster vertex deletion

This page was built for publication: Exact algorithms via monotone local search

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6829798)