Sciweavers

80 search results - page 8 / 16
» stoc 2007
Sort
View
STOC
2007
ACM
123views Algorithms» more  STOC 2007»
15 years 10 months ago
A 3-query PCP over integers
A classic result due to H?astad established that for every constant > 0, given an overdetermined system of linear equations over a finite field Fq where each equation depends o...
Venkatesan Guruswami, Prasad Raghavendra
STOC
2007
ACM
181views Algorithms» more  STOC 2007»
15 years 10 months ago
How to rank with few errors
We present a polynomial time approximation scheme (PTAS) for the minimum feedback arc set problem on tournaments. A simple weighted generalization gives a PTAS for KemenyYoung ran...
Claire Kenyon-Mathieu, Warren Schudy
STOC
2007
ACM
106views Algorithms» more  STOC 2007»
15 years 10 months ago
One sketch for all: fast algorithms for compressed sensing
Compressed Sensing is a new paradigm for acquiring the compressible signals that arise in many applications. These signals can be approximated using an amount of information much ...
Anna C. Gilbert, Martin J. Strauss, Joel A. Tropp,...
STOC
2007
ACM
117views Algorithms» more  STOC 2007»
15 years 10 months ago
A combinatorial, primal-dual approach to semidefinite programs
Semidefinite programs (SDP) have been used in many recent approximation algorithms. We develop a general primal-dual approach to solve SDPs using a generalization of the well-know...
Sanjeev Arora, Satyen Kale
STOC
2010
ACM
211views Algorithms» more  STOC 2010»
15 years 7 months ago
Maintaining a Large Matching or a Small Vertex Cover
We consider the problem of maintaining a large matching or a small vertex cover in a dynamically changing graph. Each update to the graph is either an edge deletion or an edge ins...
Krzysztof Onak and Ronitt Rubinfeld