YoVDO

Hypergraph K-Cut for Fixed K in Deterministic Polynomial Time

Offered By: IEEE via YouTube

Tags

IEEE FOCS: Foundations of Computer Science Courses Algorithms Courses Theoretical Computer Science Courses Combinatorial Optimization Courses

Course Description

Overview

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.

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

An Improved Exponential-Time Approximation Algorithm for Fully-Alternating Games Against Nature
IEEE via YouTube
Computation in the Brain Tutorial - Part 2
IEEE via YouTube
Computation in the Brain - Part 1
IEEE via YouTube
Spectral Independence in High-Dimensional Expanders and Applications to the Hardcore Model
IEEE via YouTube
Cookbook Lower Bounds for Statistical Inference in Distributed and Constrained Settings - Part 1
IEEE via YouTube