teaching:para1920
Toto je starší verze dokumentu!
Recent Topics in Parameterized Complexity
This is a three-part lecture taught by Cornelius Brand, Andreas Emil Feldmann and myself.
Topics will be roughly:
- Parameterized algorithms for integer programming and their applications in scheduling. (Martin)
- Hard graph problems (e.g., longest path, longest cycle) via algebraic methods; this will be an elementary exposition, so everyone is wellcome. (Cornelius)
- Parameterized approximation (i.e., how to deal with problems which are hard to approximate and do not admit fixed-parameter algorithms), in particular for network design. (Andreas)
teaching/para1920.1582036170.txt.gz · Poslední úprava: 2020/02/18 15:29 autor: Andreas E. Feldmann