Speaker: |
Suneel Sarswat |

Date: |
Thursday, 19 Feb 2015, 16:00 to 17:00 |

Venue: |
AG-80 |

(Scan to add to calendar)

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 lower bound known for point guards. For the same problem in a polygon $F$ with 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 designated locations.