4 search results - page 1 / 1 » NP-completeness and FPT Results for Rectilinear Covering Pro... |
JUCS
2010
13 years 2 months ago
2010
Abstract: This paper discusses three rectilinear (that is, axis-parallel) covering problems in d dimensions and their variants. The first problem is the Rectilinear Line Cover whe...
ACID
2006
13 years 5 months ago
2006
We consider the concepts of a t-total vertex cover and a t-total edge cover (t 1), which generalize the notions of a vertex cover and an edge cover, respectively. A t-total verte...
COCO
2004
Springer
13 years 8 months ago
2004
Springer
Based on the framework of parameterized complexity theory, we derive tight lower bounds on the computational complexity for a number of well-known NP-hard problems. We start by pr...
IWPEC
2009
Springer
13 years 11 months ago
2009
Springer
We study the Equitable Connected Partition problem, which is the problem of partitioning a graph into a given number of partitions, such that each partition induces a connected sub...