BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Krishna Narayanan (SFU)
DTSTART:20241212T220000Z
DTEND:20241212T230000Z
DTSTAMP:20260513T192828Z
UID:SFUOR/49
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/SFUOR/49/">C
 oping with Intractability: Parameterized Algorithms meets Linear Programmi
 ng</a>\nby Krishna Narayanan (SFU) as part of PIMS-CORDS SFU Operations Re
 search Seminar\n\nLecture held in ASB 10908.\n\nAbstract\nThis seminar wil
 l highlight the role of linear programming techniques in the design of par
 ametrized algorithms as a framework to cope with intractability\, which I 
 will attempt to motivate. After a brief introduction\, I will also briefly
  talk about the associated notion of kernelization\, which transforms inpu
 t instances into more “manageable forms”. I will then demonstrate how 
 linear programming is applied in lieu of this framework to obtain a reason
 able algorithm from a parametrized complexity perspective for an otherwise
  intractable problem like vertex cover. Lastly\, recent advancements that 
 use similar techniques for vertex cover will also be mentioned. This prese
 ntation is part of my graduate coursework on Discrete Optimization.\n
LOCATION:https://researchseminars.org/talk/SFUOR/49/
END:VEVENT
END:VCALENDAR