153 search results - page 2 / 31 » Near-linear approximation algorithms for geometric hitting s... |
ESA
2009
Springer
14 years 9 days ago
2009
Springer
We give a general framework for the problem of finding all minimal hitting sets of a family of objects in Rd by another. We apply this framework to the following problems: (i) hit...
CORR
2011
Springer
12 years 9 months ago
2011
Springer
A hitting set for a collection of sets is a set that has a nonempty intersection with each set in the collection; the hitting set problem is to find a hitting set of minimum card...
COMPGEOM
2003
ACM
13 years 11 months ago
2003
ACM
Given a set H of n hyperplanes in IRd , we present an algorithm that ε-approximates the extent between the top and bottom k levels of the arrangement of H in time O(n+(k/ε)c), w...
COMPGEOM
2006
ACM
13 years 11 months ago
2006
ACM
We study the problem of covering a set of points or polyhedra in 3 with two axis-aligned boxes in order to minimize a function of the measures of the two boxes, such as the sum or...
COCOON
2010
Springer
13 years 10 months ago
2010
Springer