Bellairs Workshop on Approximation Algorithms

Workshop Schedule.


Sunday April 3.
8am: Breakfast

  • 9-9.35am: Nikhil Bansal: The Geometry of Scheduling.
  • 9.40-10.15am: Guyslain Naves Maximum edge-disjoint paths problem in bounded treewidth graphs. Slides
  • 10.20-10.55am: Fabrizio Grandoni: Steiner Tree Approximation via Iterative Randomized Rounding

    11am: Open Problem Session I:

    Research and Discussion Time

    6pm: Dinner

  • 7pm: Seffi Naor:


    Monday April 4.
    8am: Breakfast

  • 9-9.35am: Naveen Garg Scheduling to Minimize Weighted Flow-Time.
  • 9.40-10.15am: Lisa Zhang Power-aware Routing and Scheduling
  • 10:20-10:55am: Joseph Cheriyan Approximation algorithms for k-(S,T) connectivity problems

    Research and Discussion Time

    6pm: Dinner

  • 7pm: Uriel Feige


    Tuesday April 5
    8am: Breakfast

  • 9-9.35am: Shuchi Chawla Secretary problems with convex costs.
  • 9.40-10.15am: Viswanath Nagarajan The Matroid Median Problem Slides
  • 10.20-10.55am: Nick Harvey Graph Sparsification by Edge-Connectivity and Random Spanning Trees Slides

    11am: Open Problem Session II:

    Research and Discussion Time

    6pm: Dinner

  • 7pm: Amin Saberi


    Wednesday April 6
    8am: Breakfast

  • 9:00am-9:35am: Bundit Laekhanukit An Approximation Algorithm for Minimum-Cost Subset k-Connectivity. Slides
  • 9:40am-10.15am: Neil Olver Inner Product Spaces for MinSum Coordination Mechanisms.

  • 10:20am-10.55am: Harald Raecke.

  • 10:55am-11.40am: Sameul Fiorini.

    Research and Discussion Time

    6pm: Dinner




    Thursday April 7
    8am: Breakfast

    Research and Discussion Time

    Evening: Workshop Banquet