|
Article 13
(pages 249-266)
Correlation Clustering with a Fixed Number of Clusters by Ioannis Giotis and Venkatesan Guruswami |
|
Article 12
(pages 225-247)
Matrix Approximation and Projective Clustering via Volume Sampling by Amit Deshpande, Luis Rademacher, Santosh Vempala, and Grant Wang |
|
Article 11
(pages 207-224)
Embedding the Ulam metric into ℓ1 by Moses Charikar and Robert Krauthgamer |
|
Article 10
(pages 185-206)
Learning Restricted Models of Arithmetic Circuits by Adam Klivans and Amir Shpilka |
|
Article 9
(pages 173-183)
Tolerant Versus Intolerant Testing for Boolean Properties by Eldar Fischer and Lance Fortnow |
|
Article 8
(pages 147-172)
On Learning Random DNF Formulas Under the Uniform Distribution by Jeffrey C. Jackson and Rocco A. Servedio |
|
Article 7
(pages 137-146)
An O(√n) Approximation and Integrality Gap for Disjoint Paths and Unsplittable Flow by Chandra Chekuri, Sanjeev Khanna, and F. Bruce Shepherd |
|
Article 6
(pages 121-135)
Separation of Multilinear Circuit and Formula Size by Ran Raz |
|
Article 5
(pages 91-120)
Iterative Construction of Cayley Expander Graphs by Eyal Rozenman, Aner Shalev, and Avi Wigderson |
|
Article 4
(pages 65-90)
Rank Bounds and Integrality Gaps for Cutting Planes Procedures by Joshua Buresh-Oppenheim, Nicola Galesi, Shlomo Hoory, Avner Magen, and Toniann Pitassi |
|
Article 3
(pages 53-64)
An Improved Approximation Ratio for the Covering Steiner Problem by Anupam Gupta and Aravind Srinivasan |
|
Article 2
(pages 19-51)
Proving Integrality Gaps without Knowing the Linear Program by Sanjeev Arora, Béla Bollobás, László Lovász, and Iannis Tourlakis |
|
Article 1
(pages 1-18)
All Quantum Adversary Methods are Equivalent by Robert Špalek and Mario Szegedy |