Department of Computer Science | Institute of Theoretical Computer Science | CADMO

Theory of Combinatorial Algorithms

Prof. Emo Welzl and Prof. Bernd Gärtner

Mittagsseminar (in cooperation with M. Ghaffari, A. Steger and B. Sudakov)

Mittagsseminar Talk Information

Date and Time: Thursday, October 31, 2013, 12:15 pm

Duration: 30 minutes

Location: CAB G51

Speaker: Antonis Thomas

Using SETH to prove lower bounds for graph problems with bounded treewidth.

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.


Upcoming talks     |     All previous talks     |     Talks by speaker     |     Upcoming talks in iCal format (beta version!)

Previous talks by year:   2018  2017  2016  2015  2014  2013  2012  2011  2010  2009  2008  2007  2006  2005  2004  2003  2002  2001  2000  1999  1998  1997  1996  

Information for students and suggested topics for student talks


Automatic MiSe System Software Version 1.4803M   |   admin login