Sciweavers

Share
SODA
2016
ACM
53views Algorithms» more  SODA 2016»
4 years 7 months ago
Raising The Bar For Vertex Cover: Fixed-parameter Tractability Above A Higher Guarantee
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...
Shivam Garg, Geevarghese Philip
SODA
2016
ACM
53views Algorithms» more  SODA 2016»
4 years 7 months ago
An Algorithmic Hypergraph Regularity Lemma
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...
Brendan Nagle, Vojtech Rödl, Mathias Schacht
SODA
2016
ACM
53views Algorithms» more  SODA 2016»
4 years 7 months ago
Sampling on Lattices with Free Boundary Conditions Using Randomized Extensions
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...
Sarah Cannon, Dana Randall
SODA
2016
ACM
60views Algorithms» more  SODA 2016»
4 years 7 months ago
Phase Transitions in Group Testing
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...
Jonathan Scarlett, Volkan Cevher
SODA
2016
ACM
50views Algorithms» more  SODA 2016»
4 years 7 months ago
Algorithms and Adaptivity Gaps for Stochastic Probing
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...
Anupam Gupta, Viswanath Nagarajan, Sahil Singla
SODA
2016
ACM
56views Algorithms» more  SODA 2016»
4 years 7 months ago
Evolutionary Dynamics in Finite Populations Mix Rapidly
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...
Ioannis Panageas, Piyush Srivastava, Nisheeth K. V...
SODA
2016
ACM
53views Algorithms» more  SODA 2016»
4 years 7 months ago
Persistent Homology and Nested Dissection
Michael Kerber, Donald R. Sheehy, Primoz Skraba
SODA
2016
ACM
71views Algorithms» more  SODA 2016»
4 years 7 months ago
Deterministic APSP, Orthogonal Vectors, and More: Quickly Derandomizing Razborov-Smolensky
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...
Timothy M. Chan, Ryan Williams
books