1082 search results - page 19 / 217 » Approximation Algorithms for Spreading Points |
158
click to vote
AAIM
2007
Springer
16 years 1 days ago
2007
Springer
The disc covering problem asks to cover a set of points on the plane with a minimum number of fix-sized discs. We develop an O(n(log n)2 (log log n)2 ) deterministic time 2.8334-a...
146
click to vote
STACS
2001
Springer
15 years 10 months ago
2001
Springer
The stretch factor of a Euclidean graph is the maximum ratio of the distance in the graph between any two points and their Euclidean distance. Given a set S of n points in Rd, we ...
112
click to vote
STOC
2007
ACM
16 years 6 months ago
2007
ACM
We give a randomized bi-criteria algorithm for the problem of finding a k-dimensional subspace that minimizes the Lp-error for given points, i.e., p-th root of the sum of p-th
144
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
A path from s to t on a polyhedral terrain is descending if the height of a point p never increases while we move p along the path from s to t. No efficient algorithm is known to ...
155
click to vote
ICDT
2005
ACM
15 years 11 months ago
2005
ACM
We propose and investigate from the algorithmic standpoint a novel form of fuzzy query called approximately dominating representatives or ADRs. The ADRs of a multidimensional point...