SODA
2016
ACM
8 years 8 months ago
2016
ACM
The standard parameterization of the VERTEX COVER problem (Given an undirected graph G and k ∈ N as input, does G have a vertex cover of size at most k?) has the solution size k...
SODA
2016
ACM
8 years 8 months ago
2016
ACM
Szemer´edi’s Regularity Lemma [22, 23] is one of the most powerful tools in combinatorics. It asserts that all large graphs G admit a bounded partition of E(G), most classes of...
SODA
2016
ACM
8 years 8 months ago
2016
ACM
Many statistical physics models are defined on an infinite lattice by taking appropriate limits of finite lattice regions, where a key consideration is how the boundaries are d...
SODA
2016
ACM
8 years 8 months ago
2016
ACM
The group testing problem consists of determining a sparse subset of a set of items that are “defective” based on a set of possibly noisy tests, and arises in areas such as me...
SODA
2016
ACM
8 years 8 months 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...
SODA
2016
ACM
8 years 8 months ago
2016
ACM
SODA
2016
ACM
8 years 8 months 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...
SODA
2016
ACM
8 years 8 months ago
2016
ACM
SODA
2016
ACM
8 years 8 months 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...