BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//University of Liverpool Computer Science Seminar System//v2//EN
BEGIN:VEVENT
DTSTAMP:20260826T203710Z
UID:Seminar-networks-646@lxserverM.csc.liv.ac.uk
ORGANIZER:CN=Giorgos Christodoulou:MAILTO:G.Christodoulou@liverpool.ac.uk
DTSTART:20190221T120000
DTEND:20190221T130000
SUMMARY:Networks and Distributed Computing Series
DESCRIPTION:George Skretas: Patrolling on Dynamic Ring Networks [POSTPONED]\n\nWe  study  the  problem  of  patrolling  the  nodes  of  a  network  collaboratively  by  a  team  of mobile agents, such that each node of the network is visited by at least one agent once in every I(n) time units, with the objective of minimizing the idle time I(n).  While patrolling has been studied previously for static networks,  we investigate the problem on dynamic networks with a fixed set of nodes,  but dynamic edges.\n\nIn particular,  we consider 1-interval-connected ring networks and provide various patrolling algorithms for such networks, for k= 2 for k >2 agents. We also show almost matching lower bounds that hold even for the best starting configurations. Thus, our algorithms achieve close to optimal idle time.  Further, we show a clear\nseparation in terms of idle time, for agents that have prior knowledge of the dynamic networks compared to agents  that  do  not  have  such  knowledge.   This  paper  provides  the  first  known  results  for collaborative patrolling on dynamic graphs.\n\nhttps://www.csc.liv.ac.uk/research/seminars/abstract.php?id=646
LOCATION:
END:VEVENT
END:VCALENDAR