Все публикации

0:48:48

Applications of LP Duality: Matchings, Flows and Shortest Path

0:42:21

Steiner Forest via Primal-Dual

0:37:13

MaxSat by LP Rounding

0:51:04

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

0:27:56

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

0:18:02

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

0:16:12

Simplex Algorithm, part 4: Efficiency/Pivot Rules

0:11:14

Simplex Algorithm, part 3: the simplex algorithm in general

0:15:10

Simplex Algorithm, part 1: Introductory Example

0:35:33

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

0:28:29

Integer Linear Programming

0:16:53

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

0:40:56

Linear Programming: Introduction and Examples

0:33:46

Fully Polynomial-Time Approximation Scheme for the Knapsack Problem

0:45:11

Approximation Algorithm for Metric k-Center using Parametric Pruning

0:12:45

Approximation Algorithm for Multiway Cut

0:16:46

From Set Cover to Shortest Superstring

0:17:58

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

0:21:55

Greedy Approximation Algorithm for Set Cover

0:23:07

Approximation Algorithms: Introduction by the Example of Vertex Cover

0:10:07

Practical Efficiency of Fibonacci Heaps

0:18:02

Binomial heaps (part 3/3): Lazy Union

0:19:41

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

0:29:50

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