Notes on Parameterized Complexity, Dagstuhl, June 2012.
Notes on Parameterized Complexity, Dagstuhl, June 2012.
Notes on Parameterized Complexity, Dagstuhl, June 2012.
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
COMPLEXITY POST-DF<br />
◮ Entry of Martin Grohe, Jorg Flum, Venkatesh Raman, Rolf<br />
Nidermeier and others.<br />
◮ Now the next generati<strong>on</strong>.<br />
◮ Flum-Grohe approach basing the whole thing <strong>on</strong> model<br />
checking. Make the logical depth more apparent. The<br />
A-hierarchy and E-hierarchies (with Weyer)<br />
◮ <strong>Parameterized</strong> approximati<strong>on</strong> Three groups of authors, but<br />
an old questi<strong>on</strong> of Mike: is there an FPT algo for<br />
(k, 2k)-DOMINATING SET (Open).<br />
◮ Complete inapproximability.<br />
◮ Flum-Grohe-Grüber reducti<strong>on</strong>s. Marx the best results.<br />
◮ Open no general theory.<br />
◮ <strong>Complexity</strong> and completeness for kernels.<br />
◮ Open what about iterative compressi<strong>on</strong>? What about<br />
incremental computati<strong>on</strong>? Open What about bounded<br />
search trees, though Daniel has a completeness progarm<br />
here.