BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:www.tcs.tifr.res.in/event/1370
DTSTAMP:20231212T081930Z
SUMMARY:Online Weighted Facility Location
DESCRIPTION:Speaker: Arghya Chakraborty (TIFR)\n\nAbstract: \nThe classic o
 nline facility location problem deals with finding the optimal set of faci
 lities in an online fashion when demand requests arrive one at a time and 
 facilities need to be opened to service these requests. In this work\, we 
 study a variant where each demand request is a pair (x\,w) where x is the 
 standard location of the demand while w is the corresponding weight of the
  request. The cost of servicing request (x\,w) at facility F is w⋅d(x\,F
 ). For this variant\, given n requests\, we present an online algorithm at
 taining a competitive ratio of O(log n) in the secretarial model for the w
 eighted requests and show that it is optimal.\nThis is joint work with Pro
 f. Rahul Vaze.\n
URL:https://www.tcs.tifr.res.in/web/events/1370
DTSTART;TZID=Asia/Kolkata:20231214T110000
DTEND;TZID=Asia/Kolkata:20231214T120000
LOCATION:A-201 (STCS Seminar Room)
END:VEVENT
END:VCALENDAR