Anke van Zuylen
Jones Hall, Room 125
May 2016 Students rated my teaching effectiveness for the past semester as 4.46 and 4.14 out of 5 for Elementary Probability and Statistics, and 5.0 out of 5.0 for Internet Algorithms and Economics!
April 2016 Together with András Sebő, I found a new approximation algorithm for the s-t path TSP. We give a much 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.
April 2016 I will be presenting a result on the Traveling Salesman Problem in cubic bipartite graphs at IPCO in Liege in June, and a 2-approximation algorithm for the Maximum Agreement Forest problem at ICALP in Rome in July.
May 2015 I received a Simons Collaboration Grant for Mathematicians for my proposal “Closing the Gap: Finding Better Bounds and Better Algorithms”.