1082 search results - page 89 / 217 » Approximation Algorithms for Spreading Points |
AAAI
1997
13 years 10 months ago
1997
We present empirical evidence that the distribution of e ort required to solve CSPs randomly generated at the 50% satis able point, when using a backtracking algorithm, can be app...
COLT
2010
Springer
13 years 7 months ago
2010
Springer
We consider the dimensionality-reduction problem (finding a subspace approximation of observed data) for contaminated data in the high dimensional regime, where the number of obse...
STACS
2010
Springer
14 years 4 months ago
2010
Springer
We present two new approximation algorithms with (improved) constant ratios for selecting n points in n unit disks such that the minimum pairwise distance among the points is maxi...
COMPGEOM
2006
ACM
14 years 3 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...
SODA
2012
ACM
11 years 11 months ago
2012
ACM
The problem of approximating convex bodies by polytopes is an important and well studied problem. Given a convex body K in Rd , the objective is to minimize the number of vertices...