1261 search results - page 113 / 253 » Approximation algorithms for aligning points |
STACS
2010
Springer
15 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
15 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
13 years 10 days 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...
MST
2007
14 years 9 months ago
2007
In 1996, Khanna and Motwani [KM96] proposed three logic-based optimization problems constrained by planar structure, and offered the hypothesis that these putatively fundamental ...
ICML
2006
IEEE
15 years 10 months ago
2006
IEEE
The problem of nonlinear dimensionality reduction is considered. We focus on problems where prior information is available, namely, semi-supervised dimensionality reduction. It is...