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

preview_player
Показать описание
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

  1. Ryan O'Donnell
  2. CS Theory
  3. TCS
  4. theoretical computer science
  5. Ryan O'Donnell
  6. Carnegie Mellon
Рекомендации по теме
Min-st-Cut is the 0:19:15

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

Easiest Way to 0:16:20

Easiest Way to Write the Dual of LPP - A Short Cut trick

Duality Problem 1,2 0:07:32

Duality Problem 1,2 - Linear Programming Problems (LPP) - Engineering Mathematics - 4

DUAL LINEAR PROGRAMMING 0:01:19

DUAL LINEAR PROGRAMMING

How to prove 0:02:41

How to prove that the dual linear program of the max-flow linear program indeed is a min-cut...

HOW TO WRITE 0:07:29

HOW TO WRITE DUAL TO MINIMIZATION LPP #dual #lpp #operation #research

M-28.LP and dual 0:26:33

M-28.LP and dual LP solutions to network problem

Lec-15 Primal to 0:21:12

Lec-15 Primal to dual conversion || linear Programming || Operation Research || In Hindi || Part 1

Economic Interpretation of 0:11:48

Economic Interpretation of the Dual LP

CSE202, Lec 8: 1:13:30

CSE202, Lec 8: Primal dual algorithms for mincost flow

Dual | Part 0:24:10

Dual | Part 1| How to write Dual of a Primal

LPP | Solution 0:24:30

LPP | Solution by converting primal to dual | Unbounded solution | Infeasible solution

Duality in Linear 0:32:21

Duality in Linear Programming | Primal to Dual Conversion | LPP

The Primal (P) 0:00:16

The Primal (P) and its Dual (D) Both Cannot Have Unbounded Solution ?

Dual Simplex Method 0:24:59

Dual Simplex Method Problem - Linear Programming Problems (LPP) - Engineering Mathematics 4

Could 2 People 0:13:59

Could 2 People Actually Repopulate Earth

How To Light 0:00:36

How To Light an Outdoor Gas Fire Pit Table

Generator Runs A 0:05:08

Generator Runs A Few Minutes & Dies - Here's Why!

V5 10: Linear 0:18:14

V5 10: Linear Programming: The Dual Simplex Algorithm

Linear Programming - 2:05:09

Linear Programming - Lecture 18 - The Network Simplex Method: Dual Pivoting and Two Phase Methods

Double Side PVC 0:00:13

Double Side PVC Evolis Primacy ID Card Printer (Dual Side), Output Hopper Capacity: 100 Nos

Skycut D24: Dual 0:00:59

Skycut D24: Dual Heads Cutting Plotter. Best cutting machine for Box Making

How A Gas 0:01:37

How A Gas Furnace Works (Animated Schematic)

Duality 4 Dual 0:04:05

Duality 4 Dual of an LPP with mixed constraints

Комментарии
Автор

Oh wow. I stared for a full hour at the dual problem and didn't realize that it is equivalent to the Min-st-Cut-problem. I'm so thankful that this video exists ^^

skaliks
Автор

Nice explanation for Linear Programming!

jingebao