1814 search results - page 8 / 363 » Improved Results on Geometric Hitting Set Problems |
WISE
2002
Springer
14 years 18 days ago
2002
Springer
Despite of the popularity of global search engines, people still suffer from low accuracy of site search. The primary reason lies in the difference of link structures and data sca...
GD
2009
Springer
13 years 11 months ago
2009
Springer
We show that recognizing intersection graphs of convex sets has the same complexity as deciding truth in the existential theory of the reals. Comparing this to similar results on t...
WADS
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. Settling a ten years open question, we show that the NPcomplete Feedback Vertex Set problem is deterministically solvable in O(ck ·m) time, where m denotes the number of...
CCCG
2010
13 years 9 months ago
2010
We obtain hardness results and approximation algorithms for two related geometric problems involving movement. The first is a constrained variant of the k-center problem, arising ...
TC
2008
13 years 7 months ago
2008
This paper presents a new coverage formulation addressing the quality of service of sensor networks that cooperatively detect targets traversing a region of interest. The problem o...