Bellairs Workshop on Discrepancy and Modern Rounding

Workshop Schedule.

picture


Sunday April 12th.
8am: Breakfast

  • 9:15am: James Lee: Entropy maximization, learning, and approximation
  • 10:30am: Sasho Nikolov: Hereditary discrepancy and factorization norms

  • Research and Discussion Time

    6pm: Dinner

  • 7pm: Thomas Rothvoss: A Logarithmic Additive Integrality Gap for Bin Packing


    Monday April 13th.
    8am: Breakfast

  • 9:15am: Ola Svensson: Approximating ATSP by Relaxing Connectivity
  • 10:30am: Roy Schwartz: Discrepancy without partial colorings

  • Research and Discussion Time

    6pm: Dinner

  • 7pm: Mohit Singh: Entropy and Counting


    Tuesday April 14th.
    8am: Breakfast

  • 9:15am: Nick Harvey: An Algorithmic Proof of the Lopsided Lovasz Local Lemma
  • 10:30am: Fotis Iliopoulos: Random walks that find perfect objects and the Lovasz Local Lemma

  • Research and Discussion Time

    6pm: Dinner

  • 7pm: Aravind Srinivasan: Dependent rounding with a focus on correlations


    Wednesday April 15th.
    8am: Breakfast

  • 9:15am: Zac Friggstad: Regret-bounded vehicle routing
  • 10am: Alantha Newman: Approximating graph-TSP on subquartic graphs
  • 11am: Nisheeth Vishnoi: Evolution

  • Research and Discussion Time

    Evening: Workshop Banquet


    Thursday April 16th.
    8am: Breakfast

  • 9:15am: Anupam Gupta: Independent Sets in Bounded Degree Graphs
  • 10am: Barna Saha: Language edit distance problem
  • 11am: Jochen Koenemann: Precedence constrained scheduling
  • 11:45am: Laura Sanita: Improved region growing and combinatorial algorithms for k-route cut problems

  • Research and Discussion Time

  • 7pm: Nikhil Bansal: Lovett-Meka rounding with some applications and extensions


    Friday April 2nd.
    8am: Breakfast
    Research and Discussion Time