Subexponential Algorithms for Partial Cover Problems
From MaRDI portal
Publication:2920126
DOI10.4230/LIPIcs.FSTTCS.2009.2318zbMath1248.68215OpenAlexW1589076819MaRDI QIDQ2920126
Daniel Lokshtanov, Fedor V. Fomin, Saket Saurabh, Venkatesh Raman
Publication date: 24 October 2012
Full work available at URL: http://subs.emis.de/LIPIcs/frontdoor_8f12.html
parameterized complexityirrelevant vertex techniquesubexponential time algorithmspartial cover problems
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
Inclusion/Exclusion Branching for Partial Dominating Set and Set Splitting, Planar k-Path in Subexponential Time and Polynomial Space