YoVDO

A Parameterized Approximation Scheme for Min k-Cut

Offered By: IEEE via YouTube

Tags

IEEE FOCS: Foundations of Computer Science Courses Approximation Algorithms Courses Parameterized Complexity Courses

Course Description

Overview

Explore a parameterized approximation scheme for the Min k-Cut problem in this 21-minute IEEE conference talk. Delve into the history, algorithms, and research directions presented by Daniel Lokshtanov, Saket Saurabh, and Vaishali Surianarayanan. Gain insights into tree decomposition, polynomial time algorithms, and S2K time exact solutions. Examine the proof ingredients and various research directions, including the third and fourth directions. Conclude with a comprehensive summary of the presented approximation scheme for this fundamental graph partitioning problem.

Syllabus

Intro
History
Algorithms
Research Directions
Third Direction of Research
Fourth Direction of Research
Summary
Proof Ingredients
Tree Decomposition
Polynomial Time
S2K Time Exact
Conclusion


Taught by

IEEE FOCS: Foundations of Computer Science

Tags

Related Courses

Parameterized Complexity of Quantum Invariants of Knots
Applied Algebraic Topology Network via YouTube
Sparse Integer Programming Is FPT
Hausdorff Center for Mathematics via YouTube
Recent Hardness of Approximation Results in Parameterized Complexity
Hausdorff Center for Mathematics via YouTube
Parametrized Algorithms and Possible Future Directions
Hausdorff Center for Mathematics via YouTube
Introduction to Parameterized Algorithms and Applications
Hausdorff Center for Mathematics via YouTube