Bellairs Workshop on Approximation Algorithms

Workshop Schedule.


Monday 29th March.
8am: Breakfast

  • 9-9.35am: Anupam Gupta: Approximation Algorithms for Robust Optimization and Max-Min Optimization
  • 9.40-10.15am: Kunal Talwar: Chvatal Gomory Rounding and Integrality Gaps
  • 10.20-10.55am: Jochen Konemann: Approximating Column- Restricted Covering IPs

    11am: Open Problem Session I: Some Problems

    Research and Discussion Time

    6pm: Dinner

  • 7pm: Satish Rao:


    Tuesday 30th March.
    8am: Breakfast

  • 9-9.35am: Vijay Vazirani: Combinatorial Approximation Algorithms for Convex Programs?!
  • 9.40-10.15am: Deeparnab Chakrabarty:
  • 10.20-10.55am: Matthew Andrews: Edge-Disjoint Paths via Racke Decompositions

    Research and Discussion Time

    6pm: Dinner

  • 7pm: Chandra Chekuri: Submodular Set Function Maximization: A Mini-Survey


    Wednesday 31st March.
    8am: Breakfast

  • 9-9.35am: Vahab Mirrokni: Online Stochastic Ad Allocation
  • 9.40-10.15am: Jan Vondrak: PTAS for Matroid Matching
  • 10.20-10.55am: Samuel Fiorini: Sorting under partial information (without the ellipsoid algorithm)

    11am: Open Problem Session II: More Problems

    Research and Discussion Time

    Evening: Workshop Banquet


    Thursday 1st April.
    8am: Breakfast

  • 9-9.35am: Rajmohan Rajaraman: Reducibility Among Fractional Stability Problems
  • 9.40-10.15am: Volodymyr Kuleshov:
  • 10.20-10.55am: Nicholas Harvey: Learning Submodular Functions
  • 11-11.35am: Kamal Jain:

    Research and Discussion Time

  • 7pm: Moses Charikar:


    Friday April 2nd.
    8am: Breakfast

    Research and Discussion Time

    6pm: Dinner