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

Approximation Algorithms Part I
École normale supérieure via Coursera
Approximation Algorithms Part II
École normale supérieure via Coursera
Shortest Paths Revisited, NP-Complete Problems and What To Do About Them
Stanford University via Coursera
Algorithm Design and Analysis
University of Pennsylvania via edX
Delivery Problem
University of California, San Diego via Coursera