Explore a groundbreaking algorithm for solving the hypergraph k-cut problem in deterministic polynomial time for fixed k, presented by Karthekeyan Chandrasekaran and Chandra Chekuri from UIUC. Delve into the motivations behind this research, examine partial progress in the field, and understand the innovative technique developed by the speakers. Learn about the structural theorem underpinning their approach and its implications for solving complex graph problems. Gain insights into open questions in the field and potential future directions for research in this 28-minute IEEE conference talk.
Hypergraph K-Cut for Fixed K in Deterministic Polynomial Time
Overview
Syllabus
Introduction
Hypergraph kcut
Motivations
Partial progress
The technique
The structural theorem
Our technique
Structural result
Open questions
Taught by
IEEE FOCS: Foundations of Computer Science
Tags
Related Courses
-
Near-Linear Size Hypergraph Cut Sparsifiers
-
A Parameterized Approximation Scheme for Min k-Cut
-
Polynomial Data Structure Lower Bounds in the Group Model
-
A Deterministic Algorithm for Balanced Cut with Applications to Dynamic Connectivity, Flows, and Beyond
-
Distributed Lower Bounds for Ruling Sets
-
Deterministic Distributed Expander Decomposition Routing with Applications in Distributed Derandomization
