BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:www.tcs.tifr.res.in/event/194
DTSTAMP:20230914T125914Z
SUMMARY:Art Gallery Problem
DESCRIPTION:Speaker: Pritam Bhattacharya\nTata Institute of Fundamental Res
 earch\nSchool of Technology and Computer Science\nHomi Bhabha R\n\nAbstrac
 t: \nThis talk will provide a brief introduction to the art gallery proble
 m\, which was first posed to Chvátal by Victor Klee in 1973. It basical
 ly deals with finding out the minimum number of watchmen/guards needed to 
 keep watch over an entire art gallery shaped like a simple polygon having 
 n vertices. I will be stating some theorems/conjectures (alongwith proof s
 ketches) regarding the number of guards that should be sufficient and nece
 ssary for guarding different types of simple polygons having n vertices. T
 hen\, I will describe an elegant approximation algorithm for solving this 
 problem which was suggested by Ghosh in 1986\, that closely follows the gr
 eedy approach for the minimum set-cover problem.\n\nReferences:  http://en
 .wikipedia.org/wiki/Art_gallery_problem\n
URL:https://www.tcs.tifr.res.in/web/events/194
DTSTART;VALUE=DATE:20110524
LOCATION:A-212 (STCS Seminar Room)
END:VEVENT
END:VCALENDAR