Subexponential algorithms for partial cover problems

DOI10.1016/j.ipl.2011.05.016zbMath1260.05159WikidataQ60488590 ScholiaQ60488590MaRDI QIDQ1944141

Fedor V. Fomin, Saket Saurabh, Daniel Lokshtanov, Venkatesh Raman

Publication date: 4 April 2013

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2009/2318/

zbMATH Keywords

graph algorithms; parameterized algorithms; subexponential algorithms; partial dominating set; partial cover problems

Mathematics Subject Classification ID

68W40: Analysis of algorithms

05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)

05C85: Graph algorithms (graph-theoretic aspects)

05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)