557 search results - page 1 / 112 » On the set multi-cover problem in geometric settings |
COMPGEOM
2009
ACM
14 years 1 months ago
2009
ACM
We consider the set multi-cover problem in geometric settings. Given a set of points P and a collection of geometric shapes (or sets) F, we wish to nd a minimum cardinality subse...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
Suppose we are given a finite set of points P in R3 and a collection of polytopes T that are all translates of the same polytope T. We consider two problems in this paper. The firs...
DCG
2010
13 years 7 months ago
2010
We consider the problem of computing minimum geometric hitting sets in which, given a set of geometric objects and a set of points, the goal is to compute the smallest subset of p...
COMPGEOM
2009
ACM
14 years 1 months ago
2009
ACM
We consider the problem of computing minimum geometric hitting sets in which, given a set of geometric objects and a set of points, the goal is to compute the smallest subset of p...
COMPGEOM
1997
ACM
13 years 11 months ago
1997
ACM
Given a pair of nonidentical complex objects, de ning and determining how similar they are to each other is a nontrivial problem. In data mining applications, one frequently nee...