275 search results - page 8 / 55 » Parameterized Complexity of Generalized Vertex Cover Problem... |
CJ
2008
14 years 11 months ago
2008
We survey results and open questions on complexity of parameterized problems on digraphs. The problems include the feedback vertex and arc set problems, induced subdigraph problem...
101
click to vote
ICALP
2001
Springer
15 years 4 months ago
2001
Springer
We study the generalization of covering problems to partial covering. Here we wish to cover only a desired number of elements, rather than covering all elements as in standard cov...
CATS
2008
15 years 1 months ago
2008
CORR
2010
Springer
14 years 8 months ago
2010
Springer
FAW
2008
Springer
15 years 1 months ago
2008
Springer
We study the parameterized complexity of an NP-complete geometric covering problem called d-dimensional Rectangle Stabbing where we are given a set of axis-parallel d-dimensional h...