SODA
2010
ACM
15 years 1 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 ...
SODA
2010
ACM
15 years 1 months ago
2010
ACM
SODA
2010
ACM
15 years 1 months ago
2010
ACM
SODA
2010
ACM
15 years 1 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 1 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...
SODA
2010
ACM
15 years 1 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...
SODA
2010
ACM
15 years 1 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...
SODA
2010
ACM
15 years 1 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 1 months ago
2010
ACM
SODA
2010
ACM
15 years 1 months ago
2010
ACM