8:00 | Shuttle from Hilton Chicago to TTIC |
8:30-9:00 | Breakfast |
9:00-9:40 | James Lee. Sparsest Cut and related issues. |
9:40-10:20 | Subhash Khot. Optimal Long Code Test with One Free Bit |
10:20-10:40 | Break |
10:40-11:20 | Konstantin Makarychev. Integrality Gaps for Pricing Items for Single-Minded Bidders. |
11:20-12:00 | David Steurer. New Multicut Approximations from Unique Games Algorithms. |
12:00-13:30 | Lunch |
13:30-14:10 | Vijay Vazirani. Combinatorial Approximation Algorithms for Convex Programs?! |
14:10-14:50 | Avrim Blum. Approximate Clustering without the Approximation Algorithm. |
14:50-15:30 | Anupam Gupta. Stochastic Analysis of Online Problems. |
15:30-16:00 | Break |
16:00-16:40 | Sanjeev Khanna. Approximation Algorithms for Vertex-Connectivity Survivable Network Design. |
16:40-17:20 | Joseph Cheriyan. Approximation Algorithms for Network Design. |
17:20-18:00 | Rajsekar Manokaran. Inapproximability of Maximum Acyclic Subgraph |
18:20 | Shuttle to Hilton Chicago hotel |
8:00 | Shuttle from Hilton Chicago to TTIC | 8:30-9:00 | Breakfast |
9:00-11:00 | Dana Moshkovitz. Two Query PCP with Sub-Constant Error. |
11:00-11:20 | Break |
11:20-12:00 | Ryan O'Donnell. Zwick's Conjecture is implied by most of Khot's Conjectures. |
12:00-13:30 | Lunch |
13:30-14:10 | Moses Charikar. MaxMin Allocation via Degree Lower-Bounded Arborescences. |
14:10-14:50 | Matthew Andrews. Edge-Disjoint Paths via Raecke Decompositions. |
14:50-15:30 | Nitish Korula. A Graph Reduction Step Preserving Element-Connectivity and Applications. |
15:30-16:00 | Break |
16:00-16:40 | Nikhil Bansal. Unsplittable Flow on Line Graphs. |
16:40-17:20 | Irit Dinur. 2-query PCP Composition. |
18:00 | Shuttle downtown |
18:30 | Dinner |
8:00 | Shuttle from Hilton Chicago to TTIC | 8:30 | Breakfast |
9:00-9:40 | Prasad Raghavendra. How to Round Any CSP. |
9:40-10:20 | Yury Makakrychev. Integrality Gaps for Sherali-Adams Relaxations. |
10:20-10:40 | Break |
10:40-11:20 | Samir Khuller. On Broadcast Scheduling. |
11:20-12:00 | Seffi Naor. The Primal-Dual method in Online Computation. |
12:00-13:30 | Lunch |
13:30-14:10 | Gagan Goel. A key primitive for Internet ad auctions: Budgeted Allocation. |
14:10-14:50 | Chandra Chekuri. Orienteering and variants: a mini-survey and open problems. |
14:50-15:30 | Nisheeth Vishnoi. Learning Approximately Sparse Cuts in Graphs Quickly. |
16:00 | Shuttle to Hilton hotel. |