4894 search results - page 76 / 979 » The Guarding Problem - Complexity and Approximation |
FOCS
2009
IEEE
14 years 3 months ago
2009
IEEE
We show that a k-fold covering using translates of an arbitrary convex polygon can be decomposed into Omega(k) covers (using an efficient algorithm). We generalize this result to ...
JCO
2008
13 years 9 months ago
2008
In this paper we present two main results about the inapproximability of the exemplar conserved interval distance problem of genomes. First, we prove that it is NP-complete to deci...
IPL
2007
13 years 8 months ago
2007
The disk dimension of a planar graph G is the least number k for which G embeds in the plane minus k open disks, with every vertex on the boundary of some disk. Useful properties ...
IJCAI
2001
13 years 10 months ago
2001
Although a partially observable Markov decision process (POMDP) provides an appealing model for problems of planning under uncertainty, exact algorithms for POMDPs are intractable...
CORR
2006
Springer
13 years 9 months ago
2006
Springer
Abstract: We introduce the snowblower problem (SBP), a new optimization problem that is closely related to milling problems and to some material-handling problems. The objective in...