Implicit Branching and Parameterized Partial Cover Problems (Extended Abstract)

Authors Omid Amini, Fedor Fomin, Saket Saurabh

Thumbnail PDF


  • Filesize: 436 kB
  • 12 pages

Document Identifiers

Author Details

Omid Amini
Fedor Fomin
Saket Saurabh

Cite AsGet BibTex

Omid Amini, Fedor Fomin, and Saket Saurabh. Implicit Branching and Parameterized Partial Cover Problems (Extended Abstract). In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 2, pp. 1-12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008)


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.
  • Implicit Branching
  • Parameterized Algorithms
  • Partial Dominating Set
  • Partial Vertex Cover
  • Local Treewidth


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads
Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail