Implicit branching and parameterized partial cover problems (extended abstract)

DOI10.4230/LIPICS.FSTTCS.2008.1736MaRDI QIDQ3165942zbMATH OpenOpenAlexFDO

Authors Omid Amini, Fedor V. Fomin, Saket Saurabh

Publication date 19 October 2012

Full work available at URL http://subs.emis.de/LIPIcs/frontdoor_ed0b.html

zbMATH Keywords

implicit branchinglocal treewidthparameterized algorithmspartial dominating setpartial vertex cover

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Nonnumerical algorithms (68W05) Analysis of algorithms (68W40)

Recommendations

• Implicit branching and parameterized partial cover problems
• Computing small partial coverings
• Approximation algorithms for partial covering problems
• scientific article; zbMATH DE number 1754596
• Subexponential algorithms for partial cover problems

Cited in

(7)

• Computing small partial coverings
• Subexponential algorithms for partial cover problems
• Inclusion/Exclusion Branching for Partial Dominating Set and Set Splitting
• An implicit cover problem in wild population study
• Confronting intractability via parameters
• Parameterized Complexity for Domination Problems on Degenerate Graphs
• Implicit branching and parameterized partial cover problems

This page was built for publication: Implicit branching and parameterized partial cover problems (extended abstract)

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