2.2k citations
- Massachusetts Institute of TechnologyUS303 papers
- Harvard UniversityUS23 papers
- MIT Lincoln LaboratoryUS17 papers
- IIT@MITUS16 papers
- Stanford UniversityUS16 papers
- Intel (United States)US13 papers
- Microsoft (United States)US12 papers
- University of California, BerkeleyUS12 papers
- University of WashingtonUS12 papers
- Carnegie Mellon UniversityUS11 papers
- Google (United States)US11 papers
- Massachusetts General HospitalUS11 papers
Showing 2008Show all
3 papers · 1 filter
cs.GT2008★ 49 cited
A 7/9 - Approximation Algorithm for the Maximum Traveling Salesman Problem
Katarzyna Paluch, Marcin Mucha, Aleksander Madry
We give a 7/9 - Approximation Algorithm for the Maximum Traveling Salesman Problem.
math.CO2008★ 3 cited
A Hypergraph Dictatorship Test with Perfect Completeness
Victor Chen
A hypergraph dictatorship test is first introduced by Samorodnitsky and Trevisan and serves as a key component in their unique games based $\PCP$ construction. Such a test has orac…
cs.DM2008★ 31 cited
Combining geometry and combinatorics: A unified approach to sparse signal recovery
R. Berinde, A. C. Gilbert, P. Indyk +2
There are two main algorithmic approaches to sparse signal recovery: geometric and combinatorial. The geometric approach starts with a geometric constraint on the measurement matri…