164
Voted
SODA
2010
ACM
15 years 12 months ago
2010
ACM
We present a simple and practical algorithm for the c-approximate near neighbor problem (c-NN): given n points P Rd and radius R, build a data structure which, given q Rd , can ...
79
Voted
SODA
2010
ACM
15 years 12 months ago
2010
ACM
76
Voted
SODA
2010
ACM
15 years 12 months ago
2010
ACM
93
Voted
SODA
2010
ACM
15 years 12 months ago
2010
ACM
Searching for a point in the plane is a well-known search game problem introduced in the early eigthies. The best known search strategy is given by a spiral and achieves a competi...
SODA
2010
ACM
15 years 12 months ago
2010
ACM
abstract Subhash Khot Assaf Naor In the kernel clustering problem we are given a (large) n ? n symmetric positive semidefinite matrix A = (aij) with n i=1 n j=1 aij = 0 and a (sma...
109
click to vote
SODA
2010
ACM
15 years 12 months ago
2010
ACM
In this paper, we consider the problem of designing incentive compatible auctions for multiple (homogeneous) units of a good, when bidders have private valuations and private budg...
105
Voted
SODA
2010
ACM
15 years 12 months ago
2010
ACM
Given a d-dimensional array A with N entries, the Range Minimum Query (RMQ) asks for the minimum element within a contiguous subarray of A. The 1D RMQ problem has been studied int...
136
click to vote
SODA
2010
ACM
15 years 12 months ago
2010
ACM
We study integrality gaps and approximability of two closely related problems on directed graphs. Given a set V of n nodes in an underlying asymmetric metric and two specified nod...
SODA
2010
ACM
15 years 12 months ago
2010
ACM
SODA
2010
ACM
15 years 12 months ago
2010
ACM