BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:www.tcs.tifr.res.in/event/475
DTSTAMP:20230914T125926Z
SUMMARY:Parameterized Algorithms for Minimum Vertex Cover Problem
DESCRIPTION:Speaker: Bodhayan  Roy\n\nAbstract: \nAbstract: An optimization
  problem is said to be fixed parameter tractable if there is some paramete
 r k independent of the input size n\, such that the problem can be solved 
 in O(f(k).n^c) time\, where c is a constant\, and f is an arbitrary functi
 on depending only on k. So\, for instances of NP-Hard problems where k is 
 considerably small despite large sizes of n\, such parameterized algorithm
 s run in practically affordable time. In this talk we will go through some
  parameterized algorithms for the minimum vertex cover problem of simple g
 raphs.\n
URL:https://www.tcs.tifr.res.in/web/events/475
DTSTART;TZID=Asia/Kolkata:20140321T143000
DTEND;TZID=Asia/Kolkata:20140321T160000
LOCATION:D-405 (D-Block Seminar Room)
END:VEVENT
END:VCALENDAR