Explore a groundbreaking lecture on deterministic min-cut algorithms that achieve poly-logarithmic max-flows, presented by Jason Li from Carnegie Mellon University and Debmalya Panigrahi from Duke University. Delve into cutting-edge research in graph theory and network optimization as these experts discuss innovative techniques for solving minimum cut problems efficiently. Gain insights into the latest advancements in algorithmic design and their potential applications in various fields of computer science and engineering.
Overview
Syllabus
Deterministic Min-cut in Poly-logarithmic Max-flows
Taught by
IEEE FOCS: Foundations of Computer Science
Tags
Related Courses
-
Faster Minimum k-cut of a Simple Graph
-
Subexponential LPs Approximate Max-Cut
-
Sublinear Time Algorithms for Max-Cut Approximation on Expander Graphs
-
Minimum Isolating Cuts - A New Tool for Solving Minimum Cut Problems
-
A Deterministic Algorithm for Balanced Cut with Applications to Dynamic Connectivity, Flows, and Beyond
-
Continuous-Time Quantum Walks for MAX-CUT Optimization
