"The beautiful, polytime algorithm for the postperson problem"

Abstract:
How can shortest paths, matchings and Eulerian cycles serve the post office or the waste management company? Meet the easy-going, friendly cousin of the traveling salesperson problem in this short lecture - a celebration of polynomial algorithms in combinatorial optimization!

Committee:

• Torstein Strømme
• Petr Golovach
• Jan-Joachim Rückmann

Welcome!