1082 search results - page 89 / 217 » Approximation Algorithms for Spreading Points |
119
click to vote
AAAI
1997
15 years 4 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...
121
Voted
COLT
2010
Springer
15 years 18 days 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...
119
Voted
STACS
2010
Springer
15 years 9 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...
122
click to vote
COMPGEOM
2006
ACM
15 years 8 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...
146
Voted
SODA
2012
ACM
13 years 5 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...