Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license (CC BY-NC-ND 3.0)when quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.FSTTCS.2008.1736
URN: urn:nbn:de:0030-drops-17363
URL: https://drops.dagstuhl.de/opus/volltexte/2008/1736/
Amini, Omid ; Fomin, Fedor ; Saurabh, Saket
Implicit Branching and Parameterized Partial Cover Problems (Extended Abstract)
| pdf-format: |
|
Abstract
Covering problems are fundamentalclassical 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.
BibTeX - Entry
@InProceedings{amini_et_al:LIPIcs:2008:1736,
author = {Omid Amini and Fedor Fomin and Saket Saurabh},
title = {{Implicit Branching and Parameterized Partial Cover Problems (Extended Abstract)}},
booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science},
pages = {1--12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-08-8},
ISSN = {1868-8969},
year = {2008},
volume = {2},
editor = {Ramesh Hariharan and Madhavan Mukund and V Vinay},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2008/1736},
URN = {urn:nbn:de:0030-drops-17363},
doi = {10.4230/LIPIcs.FSTTCS.2008.1736},
annote = {Keywords: Implicit Branching, Parameterized Algorithms, Partial Dominating Set, Partial Vertex Cover, Local Treewidth}
}
| Keywords: | Implicit Branching, Parameterized Algorithms, Partial Dominating Set, Partial Vertex Cover, Local Treewidth | |
| Seminar: | IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science | |
| Issue date: | 2008 | |
| Date of publication: | 05.12.2008 |
