Sciweavers

APPROX
2010
Springer
133views Algorithms» more  APPROX 2010»
12 years 10 months ago
Liftings of Tree-Structured Markov Chains - (Extended Abstract)
d Abstract) Thomas P. Hayes1 and Alistair Sinclair2 1 Department of Computer Science, University of New Mexico 2 Computer Science Division, University of California at Berkeley A &...
Thomas P. Hayes, Alistair Sinclair
APPROX
2010
Springer
189views Algorithms» more  APPROX 2010»
13 years 3 months ago
Approximating Sparsest Cut in Graphs of Bounded Treewidth
We give the first constant-factor approximation algorithm for Sparsest-Cut with general demands in bounded treewidth graphs. In contrast to previous algorithms, which rely on the f...
Eden Chlamtac, Robert Krauthgamer, Prasad Raghaven...
APPROX
2010
Springer
135views Algorithms» more  APPROX 2010»
13 years 3 months ago
Monotonicity Testing and Shortest-Path Routing on the Cube
We study the problem of monotonicity testing over the hypercube. As previously observed in several works, a positive answer to a natural question about routing properties of the hy...
Jop Briët, Sourav Chakraborty, David Garc&iac...
APPROX
2010
Springer
150views Algorithms» more  APPROX 2010»
13 years 3 months ago
Reconstruction Threshold for the Hardcore Model
In this paper we consider the reconstruction problem on the tree for the hardcore model. We determine new bounds for the non-reconstruction regime on the k-regular tree showing non...
Nayantara Bhatnagar, Allan Sly, Prasad Tetali
APPROX
2010
Springer
160views Algorithms» more  APPROX 2010»
13 years 3 months ago
Proximity Algorithms for Nearly-Doubling Spaces
We introduce a new problem in the study of doubling spaces: Given a point set S and a target dimension d , remove from S the fewest number of points so that the remaining set has d...
Lee-Ad Gottlieb, Robert Krauthgamer
APPROX
2010
Springer
138views Algorithms» more  APPROX 2010»
13 years 3 months ago
The Euclidean Distortion of Flat Tori
We show that for every n-dimensional lattice L the torus Rn /L can be embedded with distortion O(n
Ishay Haviv, Oded Regev
APPROX
2010
Springer
136views Algorithms» more  APPROX 2010»
13 years 4 months ago
Vertex Sparsifiers: New Results from Old Techniques
Matthias Englert, Anupam Gupta, Robert Krauthgamer...
APPROX
2010
Springer
188views Algorithms» more  APPROX 2010»
13 years 5 months ago
Approximation Algorithms for Reliable Stochastic Combinatorial Optimization
We consider optimization problems that can be formulated as minimizing the cost of a feasible solution wT x over an arbitrary combinatorial feasible set F {0, 1}n . For these pro...
Evdokia Nikolova
APPROX
2010
Springer
176views Algorithms» more  APPROX 2010»
13 years 5 months ago
Approximation Algorithms for Min-Max Generalization Problems
Abstract. We provide improved approximation algorithms for the minmax generalization problems considered by Du, Eppstein, Goodrich, and Lueker [1]. In min-max generalization proble...
Piotr Berman, Sofya Raskhodnikova
APPROX
2010
Springer
168views Algorithms» more  APPROX 2010»
13 years 5 months ago
Differential Privacy and the Fat-Shattering Dimension of Linear Queries
In this paper, we consider the task of answering linear queries under the constraint of differential privacy. This is a general and well-studied class of queries that captures oth...
Aaron Roth