Sciweavers

STOC
2009
ACM
139views Algorithms» more  STOC 2009»
15 years 3 days ago
Online and stochastic survivable network design
Consider the edge-connectivity survivable network design problem: given a graph G = (V, E) with edge-costs, and edgeconnectivity requirements rij Z0 for every pair of vertices i,...
Anupam Gupta, Ravishankar Krishnaswamy, R. Ravi
STOC
2009
ACM
106views Algorithms» more  STOC 2009»
15 years 3 days ago
Max cut and the smallest eigenvalue
We describe a new approximation algorithm for Max Cut. Our algorithm runs in ~O(n2 ) time, where n is the number
Luca Trevisan
STOC
2009
ACM
143views Algorithms» more  STOC 2009»
15 years 3 days ago
Affine dispersers from subspace polynomials
An affine disperser over Fn 2 for sources of dimension d is a function f : Fn 2 F2 such that for any affine space S Fn 2 of dimension at least d, we have {f(s) : s S} = F2. Aff...
Eli Ben-Sasson, Swastik Kopparty
STOC
2009
ACM
98views Algorithms» more  STOC 2009»
15 years 3 days ago
Sherali-adams relaxations of the matching polytope
We study the Sherali-Adams lift-and-project hierarchy of linear programming relaxations of the matching polytope. Our main result is an asymptotically tight expression 1 + 1/k for...
Claire Mathieu, Alistair Sinclair
STOC
2009
ACM
150views Algorithms» more  STOC 2009»
15 years 3 days ago
Integrality gaps for Sherali-Adams relaxations
We prove strong lower bounds on integrality gaps of Sherali?Adams relaxations for MAX CUT, Vertex Cover, Sparsest Cut and other problems. Our constructions show gaps for Sherali?A...
Moses Charikar, Konstantin Makarychev, Yury Makary...
STOC
2009
ACM
238views Algorithms» more  STOC 2009»
15 years 3 days ago
On the convergence of regret minimization dynamics in concave games
We study a general sub-class of concave games, which we call socially concave games. We show that if each player follows any no-external regret minimization procedure then the dyn...
Eyal Even-Dar, Yishay Mansour, Uri Nadav
STOC
2009
ACM
171views Algorithms» more  STOC 2009»
15 years 3 days ago
On the geometry of graphs with a forbidden minor
We study the topological simplification of graphs via random embeddings, leading ultimately to a reduction of the Gupta-Newman-Rabinovich-Sinclair (GNRS) L1 embedding conjecture t...
James R. Lee, Anastasios Sidiropoulos
STOC
2009
ACM
106views Algorithms» more  STOC 2009»
15 years 3 days ago
An axiomatic approach to algebrization
Non-relativization of complexity issues can be interpreted as giving some evidence that these issues cannot be resolved by "black-box" techniques. In the early 1990'...
Russell Impagliazzo, Valentine Kabanets, Antonina ...
STOC
2009
ACM
106views Algorithms» more  STOC 2009»
15 years 3 days ago
Random graphs and the parity quantifier
The classical zero-one law for first-order logic on random graphs says that for every first-order property in the theory of graphs and every p (0, 1), the probability that the r...
Phokion G. Kolaitis, Swastik Kopparty
STOC
2009
ACM
120views Algorithms» more  STOC 2009»
15 years 3 days ago
Bit-probe lower bounds for succinct data structures
We prove lower bounds on the redundancy necessary to represent a set S of objects using a number of bits close to the information-theoretic minimum log2 |S|, while answering vario...
Emanuele Viola