BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:www.tcs.tifr.res.in/event/370
DTSTAMP:20230914T125922Z
SUMMARY:How Easy/Hard it is to Schedule in Networks?
DESCRIPTION:Speaker: Karthyek Rajhaa A M\n\nAbstract: \nIn the context of s
 cheduling in networks\, we have the famous max-weight scheduling policy
  which minimizes delays\, but is computationally intensive for large net
 works. We also have policies that are computationally nice but offer no g
 uarantees on delays. The question now is:  Can we have a poly time comp
 utable scheduling policy that achieves "low" delays? We shall answer thi
 s by considering two useful models of communication networks: the independ
 ent set constraints model and the SINR model. \n\nReference: Devavrat Shah
 \, David N. C. Tse\, and John N. Tsitsiklis. 2011. Hardness of Low Delay N
 etwork Scheduling. IEEE Trans. Inf. Theor. 57\, 12 (December 2011)\, 7810-
 7817.\n
URL:https://www.tcs.tifr.res.in/web/events/370
DTSTART;TZID=Asia/Kolkata:20130524T143000
DTEND;TZID=Asia/Kolkata:20130524T160000
LOCATION:A-212 (STCS Seminar Room)
END:VEVENT
END:VCALENDAR