Title:  Approximation Algorithms

                   Chaitanya Swamny
   Center for the Mathematics of Information
       California Institute of Technology

Abstract: This is the second installment of two talks in a series of four 
talks that discuss approximation algorithms. In this lecture, I will talk 
about an elegant method, called the primal-dual method, for designing 
approximation algorithms which leverages the duality theory from linear 
programming to design provably-good algorithms for NP-hard problems.