Solving* $\mathcal{NP}$-problems in polynomial time

Abstract: While there exist problems which cannot be solved in polynomial time (unless $\mathcal P = \mathcal {NP}$), one might naturally ponder the question "How close can we get to the solution?". As it turns out, the answer is closer than you might initially think. In this talk, I will give a brief insight into the world of Approximation Algorithms, while also showing you how to solve* the problem of packing your suitcases before a flight! (*almost)

Mathematics

Audience: general audience

Gothenburg PhD seminar

Series comments: Rooms and times may vary, please check the latest update. In-person only.