May 9, 2016
Schedule
April 10 (Sun)
15:00-19:00 Check-in
19:00-21:00 Welcome Banquet
April 11 (Mon)
9:00-11:00 Introductions
11:00-12:00 2 long talks
- Laszlo Vegh: Rescaled coordinate descent methods for linear programming
- R. Ravi: Sending secrets swiftly [slide (pdf)]
14:00-15:00 Introductions
16:00-18:00 4 long talks
- Alina Ene: Routing under balance
- Debmalya Panigrahi: Online algorithms for multi-commodity network design [slide (pdf)]
- Tobias Momke: Airports and railways: facility location meets network design [slide (pdf)]
- Kristof Berczi: Degree-sequences of highly-connected digraphs
[slide (pdf)]
April 12 (Tue)
9:00-10:30 2 long talks + 2 short talks
- Alantha Newman: The alternating stock size problem and the gasoline puzzle (long)
- Yutaro Yamaguchi: How to make a bipartite graph DM-irreducible by adding edges (long) [slide (pdf)]
- Tamas Kiraly: Minimizing submodular functions on diamonds via generalized fractional matroid matchings (short) [slide (pdf)]
- Neil Olver: On the integrality gap of the cut LP for prize-collecting Steiner forest (short)
11:00-12:00 2 long talks
- Friedrich Eisenbrand: Max-sum diversity via convex programming
- Tasuku Soma: Non-convex compressed sensing with the sum-of-squares method [slide (pdf)]
14:00-15:00 2 long talks
- Andras Sebo: The salesman’s improved paths
- Anupam Gupta: The independent set problem on sparse graphs [slide (pdf)]
16:00-17:30 2 long talks + 2 short talks
- Seeun William Umboh: Recovering decompositions from noisy planar graphs (long)
- Bundit Laekhanukit: Approximating directed Steiner problems via tree embedding (long) [slide (pdf)]
- Yasushi Kawase: The secretary problem with a choice function (short)
- Zachary Friggstad: Local search yields a PTAS for k-means in doubling metrics (short)
April 13 (Wed)
9:00-10:30 2 long talks + 2 short talks
- Gyula Pap: Blocking arborescences (long) [slide (pdf)]
- Karthekeyan Chandrasekaran: Stabilizing unstable graphs through minimum modification (long)
- Naonori Kakimura: Threshold influence model for allocating advertising budgets (short) [slide (pdf)]
- Satoru Fujishige: A solution to the random assignment problem with a matroidal family of goods (short) [slide (pdf)]
11:00-12:00 2 long talks
- Seffi Naor: Multi-label classification with pairwise relations
- Sanjeev Khanna: Approximate matchings in dynamic graph streams [slide (pdf)]
13:30- Excursion & Banquet
April 14 (Thu)
9:00-10:30 2 long talks + 2 short talks
- Jakub Tarnawski: Constant-factor approximation for ATSP with two edge weights (long) [slide (pdf)]
- Venkatesan Guruswami: Coloring low-discrepancy hypergraphs and promise constraint satisfaction (long) [slide (pdf)]
- Nikhil Bansal: An improve approximation for weighted completion time on unrelated machines (short) [slide (pdf)]
- Hiroshi Hirai: Combinatorial algorithms for some multiflow problems and related network designs (short) [slide (pdf)]
11:00-12:00 2 long talks
- Viswanath Nagarajan: Approximation algorithms for inventory problems with submodular or routing costs [slide (pdf)]
- Jannik Matuschke: Recent developments in robust network flows
[slide (pdf)] (this file is locked by the same password as the open problems
14:00-16:00 Wrap-up
April 15 (Fri)
9:00-12:00 Free discussion
(for participants who wish to continue discussion)