49 search results - page 6 / 10 » Hardness of Set Cover with Intersection 1 |
116
click to vote
ESA
2003
Springer
15 years 3 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 ...
COMPGEOM
1994
ACM
15 years 2 months ago
1994
ACM
Ray (segment) shooting is the problem of determining the first intersection between a ray (directed line segment) and a collection of polygonal or polyhedral obstacles. In order t...
COMPGEOM
2010
ACM
15 years 3 months ago
2010
ACM
Let P be a set of n points in R3 . The 2-center problem for P is to find two congruent balls of the minimum radius whose union covers P. We present two randomized algorithms for ...
CORR
2008
Springer
14 years 10 months ago
2008
Springer
We study ways to expedite Yates's algorithm for computing the zeta and Moebius transforms of a function defined on the subset lattice. We develop a trimmed variant of Moebius ...
WADS
2007
Springer
15 years 4 months ago
2007
Springer
We present new asymptotically tight bounds on cuttings, a fundamental data structure in computational geometry. For n objects in space and a parameter r ∈ N, an 1 r -cutting is ...