BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Albert Vesterlund
DTSTART:20260302T153000Z
DTEND:20260302T160000Z
DTSTAMP:20260423T024025Z
UID:gbgphd/36
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/gbgphd/36/">
 Solving* $\\mathcal{NP}$-problems in polynomial time</a>\nby Albert Vester
 lund as part of Gothenburg PhD seminar\n\nLecture held in MVL14.\n\nAbstra
 ct\nWhile there exist problems which cannot be solved in polynomial time (
 unless $\\mathcal P = \\mathcal {NP}$)\, one might naturally ponder the qu
 estion "How close can we get to the solution?".\nAs it turns out\, the ans
 wer is closer than you might initially think.\nIn this talk\, I will give 
 a brief insight into the world of Approximation Algorithms\, while also sh
 owing you how to solve* the problem of packing your suitcases before a fli
 ght!\n<i>(*almost)</i>\n
LOCATION:https://researchseminars.org/talk/gbgphd/36/
END:VEVENT
END:VCALENDAR