All-Pairs Min-Cut vs. All-Pairs Shortest-Path - Amir Abboud
From Institute for Advanced Study
Computer Science/Discrete Mathematics Seminar I 10:30am|Simonyi 101 and Remote Access Topic: All-Pairs Min-Cut vs. All-Pairs Shortest-Path Speaker: Amir Abboud Affiliation: Weizmann Institute of Science Date: January 20, 2026 The All-Pairs Min-Cut problem (APMC) asks to compute the minimum cut (or equivalently, the maximum flow) between all pairs of nodes in a graph.1 The naive solution of making n^2 calls to a single-pair min-cut algorithm was surpassed in 1961 by a remarkable algorithm of G...
Who is mentioned in this episode?
4 people come up, including Gomory, Dijkstra, Jason Lee.
- Gomory (Person)
- Dijkstra (Person)
- Jason Lee (Person)
- Albert Einstein (Person)
Mentioned in this episode
- Graph (Concept)
- Max Flow (Concept)
- Shortest Path (Concept)
- All Pairs Shortest Path (Concept)
- Matrix Multiplication (Concept)
- Expander Decomposition (Concept)
- The BSG Theorem (Concept)
- Additive Combinatorics (Concept)
- Boolean Matrix Multiplication (Concept)
- Steiner Tree Packing (Concept)
- Triangle Detection (Concept)
- K Click (Concept)
- Polynomial Frame Ruia Conjecture (Concept)
- Olympics (Event)
- World Cup (Event)
- The Burning Man (Event)
- AWS re:Invent (Event)
- Super Bowl (Event)
- Oscars (Event)
- CES (Event)