2026-07-22T22:17:59Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:1736 2024-03-06T10:33:05Z ddc:004 open_access

Implicit Branching and Parameterized Partial Cover Problems (Extended Abstract) Amini, Omid Fomin, Fedor Saurabh, Saket Implicit Branching Parameterized Algorithms Partial Dominating Set Partial Vertex Cover Local Treewidth Covering problems are fundamental classical problems in optimization, computer science and complexity theory. Typically an input to these problems is a family of sets over a finite universe and the goal is to cover the elements of the universe with as few sets of the family as possible. The variations of covering problems include well known problems like Set Cover, Vertex Cover, Dominating Set and Facility Location to name a few. Recently there has been a lot of study on partial covering problems, a natural generalization of covering problems. Here, the goal is not to cover all the elements but to cover the specified number of elements with the minimum number of sets. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Omid Amini and Fedor Fomin and Saket Saurabh 2008 Is Part Of LIPIcs, Volume 2, IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (2008) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.FSTTCS.2008.1736 urn:nbn:de:0030-drops-17363 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2008.1736 eng https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode