Coursera Flash Sale
40% Off Coursera Plus for 3 Months!
Grab it
Dive into the second lecture of a mini-course on parameterized complexity, focusing on methods related to linear programming in algorithmic design. Explore advanced techniques for developing parameterized algorithms, including branching, color coding, kernelization, and width-based dynamic programming. Progress to discrete optimization problems, examining LP-guided branching and kernelization, Lenstra's algorithm for integer linear programming in fixed dimension, and methods for solving structured ILPs using Graver bases. Gain a deeper understanding of these sophisticated approaches in the field of parameterized algorithms during this 1-hour and 9-minute lecture presented by Michal Pilipczuk at the Hausdorff Center for Mathematics.
