7930 search results - page 557 / 1586 » Greedy in Approximation Algorithms |
185
click to vote
SODA
2000
ACM
15 years 8 months ago
2000
ACM
In this paper we give approximation algorithms for several proximity problems in high dimensional spaces. In particular, we give the rst Las Vegas data structure for (1 + )-neares...
304
click to vote
SIGMOD
2005
ACM
16 years 7 months ago
2005
ACM
Complex queries over high speed data streams often need to rely on approximations to keep up with their input. The research community has developed a rich literature on approximat...
187
click to vote
ISAAC
2009
Springer
16 years 1 months ago
2009
Springer
Given m unit disks and n points in the plane, the discrete unit disk cover problem is to select a minimum subset of the disks to cover the points. This problem is NP-hard [11] and ...
234
click to vote
SIROCCO
2010
15 years 8 months ago
2010
We consider asynchronous message-passing systems in which some links are timely and processes may crash. Each run defines a timeliness graph among correct processes: (p, q) is an e...
199
click to vote
STOC
2004
ACM
16 years 7 months ago
2004
ACM
The doubling dimension of a metric is the smallest k such that any ball of radius 2r can be covered using 2k balls of raThis concept for abstract metrics has been proposed as a na...