48:48

Applications of LP Duality: Matchings, Flows and Shortest Path

42:21

Steiner Forest via Primal-Dual

37:13

MaxSat by LP Rounding

51:04

LP-based Approximation Algorithms for Set Cover: LP Rounding, Primal-Dual and Dual fitting

27:56

Linear Programming (LP) Duality, part 1: Introduction and Physical Interpretation

18:02

Linear Programming (LP) Duality, part 2: Farkas Lemma

16:12

Simplex Algorithm, part 4: Efficiency/Pivot Rules

15:55

Simplex Algorithm, part 2: Exceptions

11:14

Simplex Algorithm, part 3: the simplex algorithm in general

15:10

Simplex Algorithm, part 1: Introductory Example

35:33

Theory of Linear Programming: convex polytopes, equational form and basic feasible solutions

28:29

Integer Linear Programming

16:53

Integer Linear Programming (ILP), part 2: More Examples + techniques for solving ILPs

40:56

Linear Programming: Introduction and Examples

33:46

Fully Polynomial-Time Approximation Scheme for the Knapsack Problem

45:11

Approximation Algorithm for Metric k-Center using Parametric Pruning

12:45

Approximation Algorithm for Multiway Cut

50:28

Approximations algorithms for the Steiner Tree Problem and the Traveling Salesperson Problem (TSP)

16:46

From Set Cover to Shortest Superstring

17:58

Approximation algorithm for vertex cover using local ratio (aka layering)

21:55

Greedy Approximation Algorithm for Set Cover

23:07

Approximation Algorithms: Introduction by the Example of Vertex Cover

10:07

Practical Efficiency of Fibonacci Heaps

39:04

Fibonacci Heaps

18:02

Binomial heaps (part 3/3): Lazy Union

19:41

Binomial Heaps (part 2/3): Amortized Analysis of Insert

29:50

Binomial heaps (part 1/3): Introduction and worst-case analysis

20:30

Traveling Salesperson Problem and the Held-Karp Dynamic Programming Algorithm

08:30

Djikstra's algorithms and priority queues (recap)

08:54

Dynamic Program for Rod Cutting

16:15

Advanced Algorithms - Pre-Knowledge Check

37:12

Geometric Algorithms - Beyond Theory

33:31

Quadtrees, Balanced Quadtrees, and Meshing

27:14

Potential method for amortized analysis

31:26

Windowing queries 3/3: Segment trees

16:56

Windowing queries 2/3: Priority Search Trees

27:36

Windowing queries 1/3: Interval Trees

46:00

Range Searching

01:09

Range Searching - Short Example

27:51

Line Arrangements

24:20

Geometric Duality

38:41

Polygon Triangulation, Art Gallery Problem

39:52

Convex Hull Algorithms

13:37

Doubly-connected edge lists for planar subdivisions

44:16

Plane Sweep Algorithm for finding Line Segment Intersections

19:03

Ipe tutorial (online lecture recording)

37:48

Introduction to flow networks (classroom lecture)

16:05

Vertical decomposition for point locations, part 3: analysis of randomized incremental construction

21:50

Vertical decomposition for point locations, part 2: randomized incremental construction

27:07

Vertical decomposition for point locations, part 1: the data structure

16:36

Robot Motion Planning: Rotating robots, Visibility graph (part 3 of 3)

25:41

Robot Motion Planning: Computing Minkowski sums of (convex) polygons (part 2 of 3)

17:44

Robot Motion Planning: Introduction, Road Map, and Configuration Spaces (part 1 of 3)

41:53

Delaunay triangulations (Delaunay triangulations and Voronoi diagrams, part 2)

19:52

From Dijkstra's algorithm to route planning (incl. bidirectional search & transit node routing)

15:36

Skip Lists

21:39

Voronoi diagrams (Delaunay triangulations and Voronoi diagrams, part 1)

12:34

Effective presentations

32:29

Shortest paths: Dijkstra's Algorithm

22:54

Depth-First Search (Elementary Graph Algorithms, part 3)