275 search results - page 11 / 55 » Parameterized Complexity of Generalized Vertex Cover Problem... |
MICS
2010
14 years 10 months ago
2010
The conditional covering problem (CCP) aims to locate facilities on a graph, where the vertex set represents both the demand points and the potential facility locations. The proble...
105
click to vote
IWPEC
2009
Springer
15 years 6 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...
108
click to vote
FCT
2009
Springer
15 years 6 months ago
2009
Springer
Suppose that we are given a set of n elements d of which are “defective”. A group test can check for any subset, called a pool, whether it contains a defective. It is well know...
IWPEC
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. We introduce a general notion of miniaturization of a problem that comprises the different miniaturizations of concrete problems considered so far. We develop parts of t...
104
click to vote
IPL
2007
14 years 11 months ago
2007
In this paper, we consider the parameterized complexity of the following problem: Given a hereditary property P on digraphs, an input digraph D and a positive integer k, does D ha...