Min-st-Cut is the dual LP of Max-st-Flow || @ CMU || Lecture 18d of CS Theory Toolkit @RyanODonnellTeaching
Min-st-Cut is the dual LP of Max-st-Flow || @ CMU || Lecture 18d of CS Theory Toolkit  @RyanODonnellTeaching
Uploaded June 2020 | Updated November 2026, 1 hour ago
The Min-st-Cut problem turns out to be the LP dual of the Max-st-Flow problem. Thus the Min-st-Cut equals the Max-st-Flow and both can be computed in polynomial time using Linear Programming. Lecture 18d of "CS Theory Toolkit": a semester-long graduate course on math and CS fundamentals for research in theoretical computer science, taught at Carnegie Mellon University.

Resources for this lecture:
"Understanding and Using Linear Programming" by Matoušek and Gärtner
"Geometric Algorithms and Combinatorial Optimization" by Grötschel, Lovász, and Schrijver

Taught by Ryan O'Donnell (https://www.cs.cmu.edu/~odonnell)

Course homepage on CMU's Diderot system: https://www.diderot.one/course/28/

Thumbnail photo by Rebecca Kiger (rebeccakphoto.com/)
Min-st-Cut is the dual LP of Max-st-Flow || @ CMU || Lecture 18d of CS Theory ToolkitRounding LP Solutions: Min-Vertex-Cover || @ CMU || Lecture 18c of CS Theory ToolkitLearning About Quantum States 2:  Quantum Dice, and Measurements#17/100: Unnormalized states || Quantum Computer Programming in 100 Easy Lessons#85/100: We need to find the length of a cycle || Quantum Computer Programming in 100 Easy Lessonsk-wise Independent Generators || @ CMU || Lecture 12c of CS Theory Toolkit#1/100: Toggling qubits || Quantum Computer Programming in 100 Easy Lessons#19/100: How Toggles Detective works (Part 2/2) || Quantum Computer Programming in 100 Easy LessonsPseudoexpectations || @ CMU || Lecture 21(d) of CS Theory Toolkit#4/100: What is a qubit?  || Quantum Computer Programming in 100 Easy Lessons#86/100: Rotation Estimation gives clues about L || Quantum Computer Programming in 100 Easy LessonsTrees and Series-Parallel Graphs || @ CMU || Lecture 22a of CS Theory Toolkit
Ryan ODonnell |

Min-st-Cut is the dual LP of Max-st-Flow || @ CMU || Lecture 18d of CS Theory Toolkit

SHARE TO X SHARE TO REDDIT SHARE TO FACEBOOK WALLPAPER