5624 search results - page 19 / 1125 » On Conditional Covering Problem |
TIT
2008
13 years 8 months ago
2008
The identifying code problem for a given graph involves finding a minimum set of vertices whose neighborhoods uniquely overlap at any given graph vertex. Initially introduced in 1...
IWPEC
2009
Springer
14 years 3 months ago
2009
Springer
We describe a framework for expressing the complexity of algorithms for FPT problems with two separate parameters k, m and with exponential time bounds O∗ (xk ym ) where x, y &g...
ESA
2003
Springer
14 years 1 months ago
2003
Springer
Let G = (V, E) be an undirected graph, with three numbers d0(e) ≥ d1(e) ≥ d2(e) ≥ 0 for each edge e ∈ E. A solution is a subset U ⊆ V and di(e) represents the cost contr...
CSCLP
2004
Springer
14 years 7 days ago
2004
Springer
Covering arrays have been studied for their applications to drug screening and software and hardware testing. In this paper, we model the problem as a constraint program. Our propo...
COR
2000
13 years 8 months ago
2000
The multi-vehicle covering tour problem is de"ned on a graph G"(<6=, E), where = is a set of vertices that must collectively be covered by up to m vehicles. The probl...