Bodhayan Roy Tata Institute of Fundamental Research School of Technology and Computer Science Homi Bhabha Road <br
Monday, 30 May 2011 (All day)
- A-212 (STCS Seminar Room)
This will be a talk on the proof of NP hardness of the Art Gallery Problem (which was described by Pritam last week). Approximation algorithms for the terrain guarding problem will also be described.