FOCS
2006
IEEE
14 years 6 months ago
2006
IEEE
FOCS
2006
IEEE
14 years 6 months ago
2006
IEEE
FOCS
2006
IEEE
14 years 6 months ago
2006
IEEE
In this paper we introduce a new general framework for set covering problems, based on the combination of randomized rounding of the (near-)optimal solution of the Linear Programm...
FOCS
2006
IEEE
14 years 6 months ago
2006
IEEE
We investigate the optimality of (1+ )-approximation algorithms obtained via the dimensionality reduction method. We show that: • Any data structure for the (1 + )-approximate n...
FOCS
2006
IEEE
14 years 6 months ago
2006
IEEE
We present an algorithm for the c-approximate nearest neighbor problem in a d-dimensional Euclidean space, achieving query time of O(dn1/c2 +o(1) ) and space O(dn + n1+1/c2 +o(1) ...
FOCS
2006
IEEE
14 years 6 months ago
2006
IEEE
FOCS
2006
IEEE
14 years 6 months ago
2006
IEEE
We consider approximation algorithms for non-uniform buy-at-bulk network design problems. The first nontrivial approximation algorithm for this problem is due to Charikar and Kar...
FOCS
2006
IEEE
14 years 6 months ago
2006
IEEE
We investigate variants of Lloyd’s heuristic for clustering high dimensional data in an attempt to explain its popular
FOCS
2006
IEEE
14 years 6 months ago
2006
IEEE
d abstract] Robert Krauthgamer ∗ IBM Almaden James R. Lee † Institute for Advanced Study We initiate the study of approximate algorithms on negatively curved spaces. These spa...
FOCS
2006
IEEE
14 years 6 months ago
2006
IEEE