BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:www.tcs.tifr.res.in/event/1567
DTSTAMP:20250612T104559Z
SUMMARY:Computing the Cost of Replacing Connections in a Distributed Way.
DESCRIPTION:Speaker: Dipan Dey (TIFR)\n\nAbstract: \nThe shortest path prob
 lem is one of the central problems in graph theory and algorithms. In the 
 Replacement Path problem\, we are given the source vertex s\, the target v
 ertex t\, and theshortest path between them. The goal is to compute the co
 st of replacing each edge in this path - that is\, for every edge ee on th
 e shortest path\, we must find the length of the shortest path from ss to 
 tt that avoids ee.We study this problem from a distributed perspective\, w
 here computational power and responsibility are distributed among the vert
 ices. The algorithm presented will be in the CONGEST model.This talk is ba
 sed on my recently accepted work\, Optimal Distributed Replacement Paths\,
  accepted in PODC 2025\, coauthored with Yi-Jun Chang\, Yanyu Chen\, Gopin
 ath Misra\, Hung Thuan Nguyen\, and Bryce Sanchez.The arXiv version of the
  paper can be found here: https://arxiv.org/pdf/2502.15378\n
URL:https://www.tcs.tifr.res.in/web/events/1567
DTSTART;TZID=Asia/Kolkata:20250613T171500
DTEND;TZID=Asia/Kolkata:20250613T181500
LOCATION:A-201 (STCS Seminar Room)
END:VEVENT
END:VCALENDAR