An Almost-Linear-Time Algorithm for Approximate Max Flow in Undirected Graphs... - Jonathan Kelner
An Almost-Linear-Time Algorithm for Approximate Max Flow in Undirected Graphs, and its Multicom...
TCS+ Talk: Julia Chuzoy (TTIC)
Maximum Flow and Minimum-Cost Flow in Almost-Linear Time
Almost linear time algorithms for max-flow and more (Sushant Sachdeva)
A&C Seminar: Sushant Sachdeva - Almost linear time algorithms for max-flow and more
Max-Flow and Friends, In Almost Linear Time
Near-Optimal Algorithms for Approximate Min-Cost Flow and Dynamic Shortest Paths
Cut-Approximators, Approximating Undirected Max Flows, and Recursion
Almost linear time algorithms for max-flow and more
Almost Linear Time Algorithms for Max-flow and More - Sushant Sachdeva
TCS+ Talk: Rasmus Kyng (ETH Zurich)
Karnaugh's approximation
Near-Linear Time Approximation Algorithm for Balanced Separator - Sushant Sachdeva
Sushant Sachdeva @ Princeton Theory Lunch
Jason Li on Deterministic Global Min-cut in Poly-logarithmic Max-flows
Recent Applications of Expanders to Graph Algorithms - Thatchaphol Saranurak (Uni. of Michigan)
The Laplacian Paradigm: Emerging Algorithms for Massive Graphs
Electrical Flows, Optimization, and New Approaches to the Maximum Flow Problem II: Approximating Max
8.0 - Maximum Flow
