Class Central is learner-supported. When you buy through links on our site, we may earn an affiliate commission.

YouTube

Hypergraph K-Cut for Fixed K in Deterministic Polynomial Time

IEEE via YouTube

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
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

Reviews

Start your review of Hypergraph K-Cut for Fixed K in Deterministic Polynomial Time

Never Stop Learning.

Get personalized course recommendations, track subjects and courses with reminders, and more.

Someone learning on their laptop while sitting on the floor.