Sciweavers

STOC
2004
ACM
78views Algorithms» more  STOC 2004»
14 years 3 months ago
Robust pcps of proximity, shorter pcps and applications to coding
We continue the study of the trade-off between the length of PCPs and their query complexity, establishing the following main results (which refer to proofs of satisfiability of c...
Eli Ben-Sasson, Oded Goldreich, Prahladh Harsha, M...
STOC
2004
ACM
150views Algorithms» more  STOC 2004»
14 years 3 months ago
Typical properties of winners and losers in discrete optimization
We present a probabilistic analysis for a large class of combinatorial optimization problems containing, e.g., all binary optimization problems defined by linear constraints and a...
René Beier, Berthold Vöcking
STOC
2004
ACM
94views Algorithms» more  STOC 2004»
14 years 3 months ago
Sublinear algorithms for testing monotone and unimodal distributions
The complexity of testing properties of monotone and unimodal distributions, when given access only to samples of the distribution, is investigated. Two kinds of sublineartime alg...
Tugkan Batu, Ravi Kumar, Ronitt Rubinfeld
STOC
2004
ACM
152views Algorithms» more  STOC 2004»
14 years 3 months ago
Exponential separation of quantum and classical one-way communication complexity
Abstract. We give the first exponential separation between quantum and bounded-error randomized one-way communication complexity. Specifically, we define the Hidden Matching Proble...
Ziv Bar-Yossef, T. S. Jayram, Iordanis Kerenidis
STOC
2004
ACM
87views Algorithms» more  STOC 2004»
14 years 3 months ago
Approximation algorithms for deadline-TSP and vehicle routing with time-windows
Nikhil Bansal, Avrim Blum, Shuchi Chawla, Adam Mey...
STOC
2004
ACM
61views Algorithms» more  STOC 2004»
14 years 3 months ago
The zero-one principle for switching networks
Recently, approximation analysis has been extensively used to study algorithms for routing weighted packets in various network settings. Although different techniques were applied...
Yossi Azar, Yossi Richter
STOC
2004
ACM
88views Algorithms» more  STOC 2004»
14 years 3 months ago
Expander flows, geometric embeddings and graph partitioning
We give a O( log n)-approximation algorithm for sparsest cut, edge expansion, balanced separator, and graph conductance problems. This improves the O(log n)-approximation of Leig...
Sanjeev Arora, Satish Rao, Umesh V. Vazirani
STOC
2004
ACM
177views Algorithms» more  STOC 2004»
14 years 3 months ago
Lower bounds for linear degeneracy testing
Abstract. In the late nineties, Erickson proved a remarkable lower bound on the decision tree complexity of one of the central problems of computational geometry: given n numbers, ...
Nir Ailon, Bernard Chazelle
STOC
2004
ACM
109views Algorithms» more  STOC 2004»
14 years 3 months ago
Approximating the cut-norm via Grothendieck's inequality
The cut-norm ||A||C of a real matrix A = (aij)iR,jS is the maximum, over all I R, J S of the quantity | iI,jJ aij|. This concept plays a major role in the design of efficient app...
Noga Alon, Assaf Naor