SODA
8 years 17 days ago
2016 ACM 
We report on a novel technique called spatial coupling and its application in the analysis of random constraint satisfaction problems (CSP). Spatial coupling was invented as an en...
SODA
8 years 17 days ago
2016 ACM
We show how to solve all-pairs shortest paths on n nodes in deterministic n3/2Ω( √ logn) time, and how to count the pairs of orthogonal vectors among n 0-1 vectors in d = clog...
SODA
8 years 17 days ago
2016 ACM 
At SODA’93, Chazelle and Matouˇsek presented a derandomization of Clarkson’s sampling-based algorithm [FOCS’88] for solving linear programs with n constraints and d variabl...
SODA
8 years 17 days ago
2016 ACM
We study the multiway cut problem in directed graphs and one of its special cases, the node-weighted multiway cut problem in undirected graphs. In DIRECTED MULTIWAY CUT (DIR-MC) t...
SODA
8 years 17 days ago
2016 ACM
To solve the approximate nearest neighbor search problem (NNS) on the sphere, we propose a method using locality-sensitive filters (LSF), with the property that nearby vectors ha...
|
Algorithms