85
Voted
SODA
2010
ACM
14 years 11 months ago
2010
ACM
Star-shaped bodies are an important nonconvex generalization of convex bodies (e.g., linear programming with violations). Here we present an efficient algorithm for sampling a giv...
111
Voted
SODA
2010
ACM
14 years 11 months ago
2010
ACM
120
click to vote
SODA
2010
ACM
14 years 11 months ago
2010
ACM
We give near-tight bounds for estimating the edit distance between two non-repetitive strings (Ulam distance) with constant approximation, in sub-linear time. For two strings of l...
131
Voted
SODA
2010
ACM
14 years 11 months ago
2010
ACM
We present an exact algorithm that decides, for every fixed r ≥ 2 in time O(m) + 2O(k2 ) whether a given multiset of m clauses of size r admits a truth assignment that satisfi...
SODA
2010
ACM
14 years 11 months ago
2010
ACM
Several existing cache-oblivious dynamic dictionaries achieve O(logB N) (or slightly better O(logB N M )) memory transfers per operation, where N is the number of items stored, M ...
92
Voted
SODA
2010
ACM
14 years 11 months ago
2010
ACM
: © Hardness Results for Homology Localization Chao Chen, Daniel Freedman HP Laboratories HPL-2009-374 algebraic topology, homology, localization We address the problem of localiz...
122
Voted
SODA
2010
ACM
14 years 11 months ago
2010
ACM
The partial sums problem in succinct data structures asks to preprocess an array A[1 . . n] of bits into a data structure using as close to n bits as possible, and answer queries ...
128
Voted
SODA
2010
ACM
14 years 11 months ago
2010
ACM
We consider the Asymmetric Traveling Salesman problem for costs satisfying the triangle inequality. We derive a randomized algorithm which delivers a solution within a factor O(lo...
63
Voted
SODA
2010
ACM
14 years 11 months ago
2010
ACM
73
Voted
SODA
2010
ACM
14 years 11 months ago
2010
ACM
