THIS SITE

Information for

You are here

Approximation Algorithms and the Hardness of Approximation

Saturday, April 29, 2017

BANFF

Professor Jochen Koenemann is coorganizing a 5-day workshop on Approximation Algorithms and the Hardness of Approximation at the Banff International Research Station. The workshop will be held from November 13-17, 2017.

The purpose of the workshop is to bring together leading researchers in the fields of approximation algorithms and complexity theory, and to stimulate the exchange of ideas and techniques between the two groups. Specific topics will include the Traveling Salesman Problem (TSP), the Unique Games Conjecture (UGC), and Routing Problems in graphs.

  1. 2017 (8)
    1. May (2)
    2. April (2)
    3. March (1)
    4. February (2)
    5. January (1)
  2. 2016 (22)
    1. November (2)
    2. October (2)
    3. September (5)
    4. August (1)
    5. July (2)
    6. June (2)
    7. May (2)
    8. April (4)
    9. February (1)
    10. January (1)
  3. 2015 (26)
    1. December (1)
    2. November (1)
    3. October (3)
    4. September (1)
    5. August (1)
    6. July (3)
    7. June (8)
    8. May (2)
    9. April (4)
    10. March (1)
    11. January (1)
  4. 2014 (25)
  5. 2013 (13)
  6. 2012 (12)
  7. 2011 (9)
  8. 2010 (5)
  9. 2009 (5)
  10. 2008 (2)
  11. 2007 (1)
  12. 2006 (4)
  13. 2005 (6)
  14. 2003 (1)
  15. 2002 (2)
  16. 2001 (2)