Paper Info
Title
Limits of Approximation Algorithms: PCPs and Unique Games (DIMACS Tutorial Lecture Notes)
Abstract
These are the lecture notes for the DIMACS Tutorial "Limits of Approximation Algorithms: PCPs and Unique Games" held at the DIMACS Center, CoRE Building, Rutgers University on 20-21 July, 2009. This tutorial was jointly sponsored by the DIMACS Special Focus on Hardness of Approximation, the DIMACS Special Focus on Algorithmic Foundations of the Internet, and the Center for Computational Intractability with support from the National Security Agency and the National Science Foundation. The speakers at the tutorial were Matthew Andrews, Sanjeev Arora, Moses Charikar, Prahladh Harsha, Subhash Khot, Dana Moshkovitz and Lisa Zhang. The sribes were Ashkan Aazami, Dev Desai, Igor Gorodezky, Geetha Jagannathan, Alexander S. Kulikov, Darakhshan J. Mir, Alantha Newman, Aleksandar Nikolov, David Pritchard and Gwen Spencer.
Year
Venue
Keywords
2010
Clinical Orthopaedics and Related Research
data structure,hardness of approximation,national security agency,computational complexity
Field
DocType
Volume
Discrete mathematics,Approximation algorithm,Hardness of approximation,Computer science,United States National Security Agency,Theoretical computer science,Artificial intelligence,The Internet
Journal
abs/1002.3
Citations 
PageRank 
References 
0
0.34
53
Authors
17
Name
Order
Citations
PageRank
Prahladh Harsha137132.06
Moses Charikar26094441.30
Matthew Andrews330.84
Sanjeev Arora44508379.31
Subhash Khot52064112.51
Dana Moshkovitz636819.14
Lisa Zhang767239.96
Ashkan Aazami8685.00
Dev Desai900.34
Igor Gorodezky10181.92
Geetha Jagannathan1131513.62
Alexander S. Kulikov1228025.63
Darakhshan J. Mir13626.80
Alantha Newman1439528.97
Aleksandar Nikolov1521421.87
David Pritchard1600.34
Gwen Spencer1700.34