796 search results - page 41 / 160 » Approximating the centroid is hard |
ENTCS
2006
13 years 7 months ago
2006
Bounded Model Checking (BMC) searches for counterexamples to a property with a bounded length k. If no such counterexample is found, k is increased. This process terminates when ...
COMPGEOM
2001
ACM
13 years 11 months ago
2001
ACM
We present an approximation algorithm for computing the diameter of a point-set in d-dimensions. The new algorithm is sensitive to the "hardness" of computing the diamet...
IPL
2008
13 years 7 months ago
2008
The Positive-Negative Partial Set Cover problem is introduced and its complexity, especially the hardness-of-approximation, is studied. The problem generalizes the Set Cover probl...
COCO
2004
Springer
13 years 11 months ago
2004
Springer
We initiate the study of the computational complexity of the covering radius problem for point lattices, and approximation versions of the problem for both lattices and linear cod...
GIS
2006
ACM
14 years 8 months ago
2006
ACM
If you were told that some object A was perfectly (or somewhat, or not at all) in some direction (e.g., west, above-right) of some reference object B, where in space would you loo...