10:52

Knapsack FPTAS

30:27

The Traveling Salesman Problem: When Good Enough Beats Perfect

24:42

7.3 Traveling Salesman Problem - Branch and Bound

41:04

Łukasz Kowalik "Problem komiwojażera, czyli jak obliczyć coś czego nie da się obliczyć"

6:21

Bin Packing Approximation

15:25

4.7 Traveling Salesperson Problem - Dynamic Programming

6:04

Vertex Cover Approximation

50:28

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