BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//project/author//NONSGML v1.0//EN
CALSCALE:GREGORIAN
BEGIN:VEVENT
DTEND:20210903T120000Z
UID:408b362279c30f9cecc0f7517b5aeed8-193
DTSTAMP:19700101T120016Z
DESCRIPTION:A (2 + ϵ)-approximation algorithm for preemptive weighted flow time on a single machine
URL;VALUE=URI:https://www.csa.iisc.ac.in/newweb/event/193/a-2-i%c2%b5-approximation-algorithm-for-preemptive-weighted-flow-time-on-a-single-machine/
SUMMARY:In a recent breakthrough in scheduling, Batra, Garg, and Kumar gave the first constant approximation algorithm for minimizing the sum of weighted flow times. Wiese and I (STOC 21) managed to improve this large unspecified constant to 2+ϵ. I will give a very graphic presentation of the algorithmic techniques behind this.
<br>
<br>
Microsoft Teams Link:<br>
<a href="https://teams.microsoft.com/l/meetup-join/19%3ameeting_ZGE3NDg5NzktMWQ0Zi00MzFmLTg5OTgtMTMyYWM4MWQyYjI2%40thread.v2/0?context=%7b%22Tid%22%3a%226f15cd97-f6a7-41e3-b2c5-ad4193976476%22%2c%22Oid%22%3a%227c84465e-c38b-4d7a-9a9d-ff0dfa3638b3%22%7d">
https://teams.microsoft.com/l/meetup-join/19%3ameeting_ZGE3NDg5NzktMWQ0Zi00MzFmLTg5OTgtMTMyYWM4MWQyYjI2%40thread.v2/0?context=%7b%22Tid%22%3a%226f15cd97-f6a7-41e3-b2c5-ad4193976476%22%2c%22Oid%22%3a%227c84465e-c38b-4d7a-9a9d-ff0dfa3638b3%22%7d</a>
<br>
 <br>
<br>
For more details about the seminar please visit the website at <a href="https://www.csa.iisc.ac.in/iisc-msr-seminar/">https://www.csa.iisc.ac.in/iisc-msr-seminar/</a>
DTSTART:20210903T120000Z
END:VEVENT
END:VCALENDAR