Description |
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. References: http://www.tcs.tifr.res.in/~ghosh/artgallery-approx.pdf |