Prof. Emo Welzl and Prof. Bernd Gärtner
|Mittagsseminar Talk Information|
Date and Time: Thursday, October 31, 2013, 12:15 pm
Duration: 30 minutes
Location: OAT S15/S16/S17
Speaker: Antonis Thomas
I will (try to) demonstrate the framework of [Lokshtanov, Marx & Saurabh, SODA ’11] which was described in order to prove that several known algorithms on graphs of bounded treewidth are optimal unless the Strong Exponential Time Hypothesis fails. Recently, it was shown that graphical games can be solved in O*(a^w), where a is the size of the largest strategy set available to the players and w is the treewidth of the input graph
[T. & Van Leeuwen, IPEC ’13]. A new proof that an improvement to this time bound will cause the fail of SETH will be shown and, hopefully, it will serve as a useful demonstration of the above framework.
Joint work with Jan van Leeuwen from Utrecht University.
Automatic MiSe System Software Version 1.4803M | admin login