BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:www.tcs.tifr.res.in/event/934
DTSTAMP:20230914T125944Z
SUMMARY:Parameterized Complexity of Network Design Problems
DESCRIPTION:Speaker: Pranabendu Mirsa (Department of Informatics\nUniversit
y of Bergen\nNorway)\n\nAbstract: \nAbstract: Network Design Problems\,
which concern designing minimum cost networks that satisfy given set of `
`connectivity constrains''\, are very well studied in computer science and
combinatorial optimization. Almost all these problems are NP-hard\, and a
number of results are known about them in the realm of approximation algo
rithms. Parameterized Complexity is a different framework for dealing with
computational intractability\, where typically we try to design fast algo
rithms to solve the problem on those instances which admit a ``small cost
solution''. In this talk we will look at some recent results on the parame
terized complexity of network design problems\, and future directions for
research.\n
URL:https://www.tcs.tifr.res.in/web/events/934
DTSTART;TZID=Asia/Kolkata:20190110T143000
DTEND;TZID=Asia/Kolkata:20190110T153000
LOCATION:A-201 (STCS Seminar Room)
END:VEVENT
END:VCALENDAR