Slide 1Hypercontractive inequalities via SOS, and the Frankl-Rödl graph Manuel Kauers (Johannes Kepler Universität) Ryan ODonnell (Carnegie Mellon University) Li-Yang Tan…

Slide 1Routing in Undirected Graphs with Constant Congestion Julia Chuzhoy Toyota Technological Institute at Chicago Slide 2 Routing Problems Input: Graph G, source-sink…

Slide 1Exploring the border between P and NP Uriel Feige Weizmann Institute 1 Slide 2 Computational Intractability Convention: tractable = polynomial time. When a computational…

1. Quiz Club-IITK Krishnan.T.S EE,Mtech,2 ndYear 2. Ques 1) *)7 thjuly 2005 England vs Australia,Headingley 3. Ans) This was the first time that theSuper Subrule was introduced…

Slide 1A Simple, Greedy Approximation Algorithm for MAX SAT David P. Williamson Joint work with Matthias Poloczek (Frankfurt, Cornell) and Anke van Zuylen (William &…

Slide 1 Two Query PCP with Subconstant Error Dana Moshkovitz Princeton University and The Institute for Advanced Study Ran Raz The Weizmann Institute 1 Slide 2 This Talk…

Slide 1 A polylogarithmic approximation of the minimum bisection Robert Krauthgamer The Hebrew University Joint work with Uri Feige Slide 2 2 Graph bisection Let G(V,E) be…

Slide 1 The Traveling Salesman Problem in Theory & Practice Lecture 2: NP-Hardness 28 January 2014 David S. Johnson [email protected] http://davidsjohnson.net Seeley…

Slide 1 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 Slide…

Slide 1 The Use of Semidefinite Programming in Approximation Algorithms Uriel Feige The Weizmann Institute Slide 2 Combinatorial Optimization A combinatorial optimization…