BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//University of Liverpool Computer Science Seminar System//v2//EN
BEGIN:VEVENT
DTSTAMP:20260627T053127Z
UID:Seminar-acto-1095@lxserverM.csc.liv.ac.uk
ORGANIZER:CN=Nikhil Mande:MAILTO:Nikhil.Mande@liverpool
DTSTART:20230810T130000
DTEND:20230810T140000
SUMMARY:Algorithms, Complexity Theory and Optimisation Series
DESCRIPTION:Akitoshi Kawamura: Density threshold in pinwheel scheduling\n\n In Pinwheel Scheduling Problem, we are given a set of jobs i, each of\nwhich must be done with period a_i, i.e., done at least once during any\nconsecutive a_i days.  We ask whether we can achieve this (perpetually)\nby doing one job every day.  An obvious necessary condition is that the\nsum of the reciprocals 1/a_i not exceed 1.  It is also not hard to see\nthat the jobs can be scheduled if this sum is 1/2 or smaller.  We show\nthat this bound can be increased to 5/6 (which is the best possible), as\nconjectured by Chan and Chin.\n\nhttps://www.csc.liv.ac.uk/research/seminars/abstract.php?id=1095
LOCATION:Ashton 2.08
END:VEVENT
END:VCALENDAR