1672 search results - page 52 / 335 » Tightness problems in the plane |
DAM
1999
13 years 8 months ago
1999
We consider a search game on a graph in which one cop in a helicopter flying from vertex to vertex tries to catch the invisible robber. The existence of the winning program for th...
SODA
2012
ACM
11 years 11 months ago
2012
ACM
Kernelization algorithms are polynomial-time reductions from a problem to itself that guarantee their output to have a size not exceeding some bound. For example, d-Set Matching f...
MP
2006
13 years 8 months ago
2006
We study two different lot-sizing problems with time windows that have been proposed recently. For the case of production time windows, in which each client specific order must be ...
ESA
2003
Springer
14 years 2 months ago
2003
Springer
We prove that various geometric covering problems, related to the Travelling Salesman Problem cannot be efficiently approximated to within any constant factor unless P = NP. This ...
FOCS
1997
IEEE
14 years 1 months ago
1997
IEEE
We consider the problem of deciding whether a polygonal knot in 3dimensional Euclidean space is unknotted, capable of being continuously deformed without self-intersection so that...