Approximation Algorithms Based on Primal-Dual Simplex Method
Place:
CoRE Building, Room 433 (NOTE ROOM CHANGE)
Busch Campus, Rutgers University.
Time:
3:00
Thursday, February 8, 1996
This will be the first in a series of discussions, lead by
Sridhar Rajagopolan, about various recent papers in the
area.
We will read heavily from the survey paper,
``The Primal-Dual Method for Approximation Algorithms
and its Application to Network Design Problems''
by D.P. Williamson and M.X. Goemans.
This paper is available on the WWW at
http://theory.lcs.mit.edu/~goemans/
and copies will also be available (hopefully by
Wednesday, February 7) at the DIMACS office CORE 406,
>from Ida or Cheryl.