ViewTube

ViewTube
Sign inSign upSubscriptions
Filters

Upload date

Type

Duration

Sort by

Features

Reset

786 results

Thatchaphol Saranurak
Lecture 22: Push Relabel (Part 2): Approximate Maximum Flow

... mashing okay but uh we can actually model maximum mashing by high maximum meshing as the as the flow problem actually ...

1:23:51
Lecture 22: Push Relabel (Part 2): Approximate Maximum Flow

0 views

5 days ago

khalwsh
Flows

in this video I explained 1 - max-flow 2 - min-cost max flow 3 - Hungarian algorithm.

3:42:33
Flows

350 views

7 days ago

Elad Hazan
LEC FEB 05 2026

lecture 4 - given by Rohit Agarwal.

1:20:34
LEC FEB 05 2026

28 views

21 hours ago

Thatchaphol Saranurak
Lecture 14.1: Expanding Balanced Separators in Polylog Max Flow

And what we're going to do is this given any graph right we're going to find uh we can just find this flow expanding by line ...

21:42
Lecture 14.1: Expanding Balanced Separators in Polylog Max Flow

2 views

5 days ago

Thatchaphol Saranurak
Lecture 28: Combinatorial Max Flow in n^2 Time (Part 1): Shortcut via SE Hierarchy

... to compute stac flow okay so here is a exact m maximum flow but one thing to note is that you can actually reduce the problem ...

1:22:35
Lecture 28: Combinatorial Max Flow in n^2 Time (Part 1): Shortcut via SE Hierarchy

20 views

5 days ago

Thatchaphol Saranurak
Lecture 31: Combinatorial Max Flow in n^2 Time (Part 4): Putting Everything Together

... it's a good open problem yeah how to get expanded trimming for any note wedding if if i like so blackbox mac flow i allow you to ...

1:22:02
Lecture 31: Combinatorial Max Flow in n^2 Time (Part 4): Putting Everything Together

10 views

5 days ago

Thatchaphol Saranurak
Lecture 13: Approximate Sparsest Cut in Polylog Max Flows

... try to send flow like maximum flow from source to sync right so then we just observe what happened and basically just by using ...

57:47
Lecture 13: Approximate Sparsest Cut in Polylog Max Flows

0 views

5 days ago

Thatchaphol Saranurak
Lecture 26.2: Approximate Max Flow in Almost Linear Time via MWU: General Graphs

... Yeah But today we we just talk about single commodity flow problem Um so yeah Okay So that's the that's our strategy right And ...

52:11
Lecture 26.2: Approximate Max Flow in Almost Linear Time via MWU: General Graphs

0 views

5 days ago

Thatchaphol Saranurak
Lecture 30: Combinatorial Max Flow in n^2 Time (Part 3): Leaky Expander Decomposition and Hierarchy

... flow in original graph with without much more congestion Now these two assumption can be reduced to the problem in the next ...

1:24:27
Lecture 30: Combinatorial Max Flow in n^2 Time (Part 3): Leaky Expander Decomposition and Hierarchy

12 views

5 days ago

Thatchaphol Saranurak
Lecture 29: Combinatorial Max Flow in n^2 Time (Part 2): Relabel-Aggressive Push Relabel

... close to maximum where what do I mean here like it's big as big as far where f is a maximum flow for this sen is a maximum flow ...

49:07
Lecture 29: Combinatorial Max Flow in n^2 Time (Part 2): Relabel-Aggressive Push Relabel

11 views

5 days ago

Thatchaphol Saranurak
Lecture 21.1: Push Relabel (Part 0): Background on Residual Graphs and Preflow

... so now we are trying to solve flow problem and we're going to have like sauce notewing and sync not wedding like before okay ...

24:45
Lecture 21.1: Push Relabel (Part 0): Background on Residual Graphs and Preflow

5 views

5 days ago

Thatchaphol Saranurak
Lecture 21.2: Push Relabel (Part 1): Exact Max Flow

... going to compute maximum flow like before it's just faster and yeah um instead of push through a single edge just push through ...

1:21:12
Lecture 21.2: Push Relabel (Part 1): Exact Max Flow

2 views

5 days ago

Thatchaphol Saranurak
Lecture 14.2: Expanding Balanced Separators in Polylog Max Flow (Continued)

... log square expanding separator okay and the time is something like polylock flow and like we kind of reduce the problem to like ...

51:51
Lecture 14.2: Expanding Balanced Separators in Polylog Max Flow (Continued)

3 views

5 days ago

Thatchaphol Saranurak
Lecture 32.1: Beyond this Course

Okay Yeah So shortest path and max flow are kind of quite different like they are both flow problem but max flow is kind of you ...

1:23:10
Lecture 32.1: Beyond this Course

0 views

5 days ago

Thatchaphol Saranurak
Lecture 26.1: Approximate Max Flow in Almost Linear Time via MWU: Expander Case

... approximate map flow problem okay so if if like uh if you use uh if if epsilon is zero you can see that like just by using maximum ...

1:22:59
Lecture 26.1: Approximate Max Flow in Almost Linear Time via MWU: Expander Case

4 views

5 days ago

Thatchaphol Saranurak
Lecture 15.2: Expander Decomposition in Polylog Max Flow (Continued)

Question okay so here's the algorithm it's just this so you imagine that you send like try to send flow like comput flow and min cut ...

51:49
Lecture 15.2: Expander Decomposition in Polylog Max Flow (Continued)

0 views

5 days ago

Thatchaphol Saranurak
Lecture 15.1: Expander Decomposition in Polylog Max Flow

So that's not quite like that like that that is just like one call to Mac flow right one call to Mac flow you like you have the source and ...

27:22
Lecture 15.1: Expander Decomposition in Polylog Max Flow

2 views

5 days ago

Dwarkesh Patel and Stripe
Elon Musk – "In 36 months, the cheapest place to put AI will be space”

In this episode, John and I got to do a real deep-dive with Elon. We discuss the economics of orbital data centers, the difficulties of ...

2:49:46
Elon Musk – "In 36 months, the cheapest place to put AI will be space”

700,742 views

5 days ago

Metics Media
Full OpenClaw Setup Tutorial: Step-by-Step Walkthrough (Clawdbot)

In this Full OpenClaw Setup Tutorial, I'll walk you through how to install and configure OpenClaw step by step, so you can get an ...

17:39
Full OpenClaw Setup Tutorial: Step-by-Step Walkthrough (Clawdbot)

54,007 views

7 days ago

Amir Goharshady
Oxford Algorithms and Data Structures - Lecture 6 - Network Flows, Max-flow Min-cut, Ford-Fulkerson

Algorithms and Data Structures (ADS) Hilary Term 2026 Taught by Amir Goharshady ...

52:20
Oxford Algorithms and Data Structures - Lecture 6 - Network Flows, Max-flow Min-cut, Ford-Fulkerson

54 views

4 days ago