Anke van Zuylen
Jones Hall, Room 125
October 2016 I presented my paper with András Sebő on a new approximation algorithm for the s-t path TSP at FOCS 2016. We give a simpler framework for analyzing the "best-of-many" Christofides algorithms from the literature, and we introduce a key new idea of deleting edges from the initial trees. We show that the arising connectivity problems can be solved for a minor extra cost, thus allowing us to more than halve the gap between the best known ratio and the conjectured integrality gap of 3/2.
August 2016 I will be teaching Linear Programming (LP) for Master's students, and Elementary Probability and Statistics for undergraduate students this fall. I am excited to be switching the software used in our LP course from AMPL to Python and Gurobi. Here is a Jupyter Notebook containing the first lab exercises.
May 2015 I received a Simons Collaboration Grant for Mathematicians for my proposal “Closing the Gap: Finding Better Bounds and Better Algorithms”.