Department of Computer Science | Institute of Theoretical Computer Science | CADMO

Prof. Emo Welzl and Prof. Bernd Gärtner

Mittagsseminar Talk Information |

**Date and Time**: Tuesday, September 18, 2018, 12:15 pm

**Duration**: 30 minutes

**Location**: OAT S15/S16/S17

**Speaker**: Pascal Pfister

A classical multi-agent fence patrolling problem asks: What is the maximum length L of a line that k agents with maximum speeds v_1,...,v_k can patrol if each point on the line needs to be visited at least once every unit of time. It is easy to see that L = a\sum_{i=1}^k v_i for some efficiency 1/2 ≤ a < 1. After a series of works giving better and better efficiencies, it was conjectured that the best possible efficiency approaches 2/3. We constructed a scheme whose efficiency is equal to 1 - \theta(1/\sqrt{k}), thus disproving the above conjecture of Kawamura and Kobayashi. Moreover, we also provide an asymtotically matching upper bound for a.

Upcoming talks | All previous talks | Talks by speaker | Upcoming talks in iCal format (beta version!)

Previous talks by year: 2023 2022 2021 2020 2019 2018 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2004 2003 2002 2001 2000 1999 1998 1997 1996

Information for students and suggested topics for student talks

Automatic MiSe System Software Version 1.4803M | admin login