4894 search results - page 8 / 979 » The Guarding Problem - Complexity and Approximation |
IWOCA
2009
Springer
14 years 2 months ago
2009
Springer
A vertex subset D of a graph G is a dominating set if every vertex of G is either in D or is adjacent to a vertex in D. The paired-domination problem on G asks for a minimum-cardi...
SC
1995
ACM
13 years 11 months ago
1995
ACM
Because large scienti c codes are rarely static objects, developers are often faced with the tedious task of accounting for discrepancies between new and old versions. In this pap...
CCCG
2006
13 years 9 months ago
2006
A room is a simple polygon with a prespecified point, called the door, on its boundary. A search starts at the door and must detect any intruder that may be in the room, while maki...
COCO
2010
Springer
13 years 11 months ago
2010
Springer
We prove that weighted monotone/antimonotone circuit satisfiability has no fixed-parameter tractable approximation algorithm with any approximation ratio function ρ, unless FPT...
RTAS
2005
IEEE
14 years 1 months ago
2005
IEEE
No one middleware communication model completely solves the problem of ensuring schedulability in every DRE system. Furthermore, there have been few studies to date of the trade-o...