City: Saint Petersburg Novosibirsk Kazan Language: Русский English

Parameterized Algorithms
Saint Petersburg / spring 2011, посмотреть все семестры

Enroll in the course to get notifications and to be able to submit home assignments.
Register to enroll now Login

Parameterized complexity is one of the approaches of dealing with computational intractability. The philosophy of parameterized complexity is that beyond overall input size, key secondary measurements fundamentally affect the computational complexity of problems and govern the opportunities for designing efficient algorithms. This course is an introduction to the main algorithmic techniques (like kernelization, bounded search trees, color coding, iterative compression, treewidth, and graph minors theory) for obtaining fixed-parameter tractable algorithms.