All presentations take place at the Calvin Lab Auditorium.

–
Coffee and Check-In
–
Opening Remarks
–
The Power of Hierarchies for Detecting Hidden Structures
Prasad Raghavendra, UC Berkeley
–
Break
–
Simplex Transformations and Multiway Cut
Roy Schwartz, Technion - Israel Institute of Technology
–
LPs and Convex Programming Relaxations and Rounding for Stochastic Problems
Anupam Gupta, Carnegie Mellon University
–
Lunch
–
Discrepancy and Approximation Algorithms
Sasho Nikolov, University of Toronto
–
Break
–
On Approximating the Covering Radius and Finding Dense Lattice Subspaces
Daniel Dadush, Centrum Wiskunde & Informatica
–
A Strongly Polynomial Algorithm for Bimodular Integer Linear Programming
Rico Zenklusen, ETH Zürich
–
Reception
–
Coffee and Check-In
–
Improved Approximation Algorithms for the TSP and S-t-path TSP
David Shmoys, , Cornell University
–
Break
–
A Constant-factor Approximation Algorithm for the Asymmetric Traveling Salesman Problem
László Végh, London School of Economics
–
Lunch
–
Compact, Provably-good LPs for Orienteering and Regret-bounded Vehicle Routing
Chaitanya Swamy, University of Waterloo
–
Surviving in Directed Graphs: A Quasi-polynomial-time Polylogarithmic Approximation for Two-connected Directed Steiner Tree
Fabrizio Grandoni, IDSIA, University of Lugano
–
Break
–
Improved Approximation for Non-preemptive Scheduling via Time-indexed LP Relaxations
Shi Li, SUNY Buffalo
–
LP Rounding for Poise
R. Ravi, Carnegie Mellon University
–
Lightning Talks
–
Coffee and Check-In
–
Submodular Optimization
Niv Buchbinder, Tel Aviv University
–
Break
–
Submodular Unsplittable Flow on Trees
Anna Adamaszek, University of Copenhagen
–
A Nearly-linear Time Algorithm for Submodular Maximization with a Knapsack Constraint
Alina Ene, Boston University
–
Lunch
–
Online Optimization, Smoothing, and Competitive Ratio
Maryam Fazel, University of Washington
–
Break
–
The Non-Uniform k-Center Problem
Deeparnab Chakrabarty (Dartmouth College)
–
Scheduling on Related Machines
Debmalya Panigrahi, Duke University
–
Coffee and Check-In
–
Beyond Worst Case Analysis in Approximation
Uri Feige, Weizmann Institute of Science
–
Break
–
Algorithms for Stable and Perturbation-resilient Problems
Kostya Makarychev, Northwestern University
–
Low Diameter Graph Decompositions and Approximating Unique Games
Lap-Chi Lau, University of Waterloo
–
Lunch
–
A (1+epsilon)-approximation for Makespan Scheduling with Precedence Constraints Using LP Hierarchies
Thomas Rothvoß, University of Washington
–
Break
–
LP Relaxations for Reordering Buffer Management
Yuval Rabani, The Hebrew University of Jerusalem
–
Finding Best LP Relaxations for Various Cut Problems
Euiwoong Lee, Carnegie Mellon University
–
Coffee and Check-In
–
A Survey of Dependent Rounding
Aravind Srinivasan,, University of Maryland
–
Break
–
Subdeterminant Maximization via Nonconvex Relaxations and Anti-concentration
Nisheeth Vishnoi, École Polytechnique Fédérale de Lausanne
–
Approximating the Permanent of Positive Semidefinite Matrices
Nima Anari, , Stanford University
–
Local Guarantees in Graph Cuts and Clustering
Moses Charikar, Stanford University