158
click to vote
SODA
2016
ACM
10 years 19 days ago
2016
ACM
A stochastic probing problem consists of a set of elements whose values are independent random variables. The algorithm knows the distributions of these variables, but not the act...
190
click to vote
SODA
2016
ACM
10 years 19 days ago
2016
ACM
In this paper we prove that the mixing time of a broad class of evolutionary dynamics in finite, unstructured populations is roughly logarithmic in the size of the state space. A...
171
click to vote
SODA
2016
ACM
10 years 19 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...
146
click to vote
SODA
2016
ACM
10 years 19 days ago
2016
ACM
Online d-dimensional vector packing models many settings such as minimizing resources in data centers where jobs have multiple resource requirements (CPU, Memory, etc.). However, ...
133
click to vote
SODA
2016
ACM
10 years 19 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...
129
click to vote
SODA
2016
ACM
10 years 19 days ago
2016
ACM
We present an approximation algorithm for the maximum weight matroid intersection problem in the independence oracle model. Given two matroids defined over a common ground set N ...