Seminars

View all Seminars  |  Download ICal for this event

A (2 + ϵ)-approximation algorithm for preemptive weighted flow time on a single machine

Series: Theory Seminar

Speaker: Dr. Lars Rohwedder Postdoctoral Researcher Theoretical Computer Science EPFL, Lausanne (Switzerland)

Date/Time: Sep 03 16:00:00

Location: Microsoft Teams - ON-LINE

Faculty Advisor:

Abstract:
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.

Microsoft Teams Link:
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


For more details about the seminar please visit the website at https://www.csa.iisc.ac.in/iisc-msr-seminar/

Speaker Bio:

Host Faculty: Dr. Arindam Khan