Upload File

The top documents tagged [hardness of approximation]

Network Design with Degree Constraints Guy Kortsarz Joint work with Rohit Khandekar and Zeev Nutov
Network Design with Degree Constraints Guy Kortsarz Joint work with Rohit Khandekar and Zeev Nutov
217 views
Hypercontractive inequalities via SOS, and the Frankl-Rödl graph Manuel Kauers (Johannes Kepler Universität) Ryan ODonnell (Carnegie Mellon University)
Hypercontractive inequalities via SOS, and the Frankl-Rödl graph Manuel Kauers (Johannes Kepler Universität) Ryan ODonnell (Carnegie Mellon University)
213 views
Routing in Undirected Graphs with Constant Congestion Julia Chuzhoy Toyota Technological Institute at Chicago
Routing in Undirected Graphs with Constant Congestion Julia Chuzhoy Toyota Technological Institute at Chicago
216 views
Parallel Repetition of Two Prover Games Ran Raz Weizmann Institute and IAS
Parallel Repetition of Two Prover Games Ran Raz Weizmann Institute and IAS
213 views
Exploring the border between P and NP Uriel Feige Weizmann Institute 1
Exploring the border between P and NP Uriel Feige Weizmann Institute 1
215 views
krishnan's quiz
krishnan's quiz
2.881 views
A Simple, Greedy Approximation Algorithm for MAX SAT David P. Williamson Joint work with Matthias Poloczek (Frankfurt, Cornell) and Anke van Zuylen (William
A Simple, Greedy Approximation Algorithm for MAX SAT David P. Williamson Joint work with Matthias Poloczek (Frankfurt, Cornell) and Anke van Zuylen (William
217 views
Two Query PCP with Subconstant Error Dana Moshkovitz Princeton University and The Institute for Advanced Study Ran Raz The Weizmann Institute 1
Two Query PCP with Subconstant Error Dana Moshkovitz Princeton University and The Institute for Advanced Study Ran Raz The Weizmann Institute 1
219 views
A polylogarithmic approximation of the minimum bisection Robert Krauthgamer The Hebrew University Joint work with Uri Feige
A polylogarithmic approximation of the minimum bisection Robert Krauthgamer The Hebrew University Joint work with Uri Feige
220 views
The Traveling Salesman Problem in Theory & Practice Lecture 2: NP-Hardness 28 January 2014 David S. Johnson dstiflerj@gmail.com
The Traveling Salesman Problem in Theory & Practice Lecture 2: NP-Hardness 28 January 2014 David S. Johnson [email protected]
218 views
On the Fourier Tails of Bounded Functions over the Discrete Cube Irit Dinur, Ehud Friedgut, and Ryan O’Donnell Joint work with Guy Kindler Microsoft Research
On the Fourier Tails of Bounded Functions over the Discrete Cube Irit Dinur, Ehud Friedgut, and Ryan O’Donnell Joint work with Guy Kindler Microsoft Research
216 views
The Use of Semidefinite Programming in Approximation Algorithms Uriel Feige The Weizmann Institute
The Use of Semidefinite Programming in Approximation Algorithms Uriel Feige The Weizmann Institute
217 views