NP-Hardness of Art Gallery Problem & Terrain Guarding Problem
Student Seminar
Speaker:
Bodhayan Roy
Tata Institute of Fundamental Research
School of Technology and Computer Science
Homi Bhabha Road
Date:
Monday, 30 May 2011 (all day)
Venue:
A-212 (STCS Seminar Room)
(Scan to add to calendar)
Abstract:
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.