BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:www.tcs.tifr.res.in/event/577
DTSTAMP:20230914T125930Z
SUMMARY:Studying Lower Bounds for Conflict-free Colouring of Guards in Poly
 gons
DESCRIPTION:Speaker: Suneel Sarswat\n\nAbstract: \nAbstract: Art gallery pr
 oblem is to determine the number of guards that are sufficient to see or c
 over all points in $P$. Consider the problem of placing colour guards in a
 n $n$-sided polygon $P$ such that every point $z \\in P$ sees one guard wh
 ose colour is different from all other guards visible from $z$. Such place
 ment of colour guards is known as weak conflict-free colouring of $P$.\n\n
 We derive a lower bound of $\\Omega(\\log \\log n)$ for weak conflict-free
  colouring of point guards in a simple polygon. There is no non-trivial lo
 wer bound known for point guards. For the same problem in a polygon $F$ wi
 th holes\, we also derive a lower bound of $\\Omega(\\log n)$\, where the 
 guards are allowed to be placed at all locations inside $F$ except some de
 signated locations.\n
URL:https://www.tcs.tifr.res.in/web/events/577
DTSTART;TZID=Asia/Kolkata:20150219T160000
DTEND;TZID=Asia/Kolkata:20150219T170000
LOCATION:AG-80
END:VEVENT
END:VCALENDAR