BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:www.tcs.tifr.res.in/event/451
DTSTAMP:20230914T125925Z
SUMMARY:Online Algorithms for Node-weighted Network Design
DESCRIPTION:Speaker: Debmalya Panigrahi (Duke University\nDepartment of Com
 puter Science\nCampus Box 90129\n308\, Research Drive (LSRC Building)\nDur
 ham\, NC 27708\nUnited States of America)\n\nAbstract: \nAbstract: In rece
 nt years\, an online adaptation of the classical primal-dual paradigm has 
 been successfully used to obtain new online algorithms for node-weighted n
 etwork design problems\, and simplify existing ones for their edge-weighte
 d counterparts. In this talk\, I will give an outline of this emerging too
 lbox using three fundamental problems in this category for illustration: t
 he Steiner tree problem (Naor-P.-Singh\, 2011)\, the Steiner forest proble
 m (Hajiaghayi-Liaghat- P.\, 2013)\, and their respective prize-collecting 
 variants (Hajiaghayi-Liaghat-P.\, 2014).\n
URL:https://www.tcs.tifr.res.in/web/events/451
DTSTART;TZID=Asia/Kolkata:20140203T154500
DTEND;TZID=Asia/Kolkata:20140203T170000
LOCATION:D-405 (D-Block Seminar Room)
END:VEVENT
END:VCALENDAR