13:57

An FPTAS for the Knapsack Problem

1:21:08

17. Complexity: Approximation Algorithms

12:13

The Knapsack Problem & Genetic Algorithms - Computerphile

6:04

Vertex Cover Approximation

6:10

What are pseudo-polynomial run times? | Knapsack Dynamic Programming

20:30

The 0/1 Knapsack Problem (Demystifying Dynamic Programming)

6:21

Bin Packing Approximation

13:29

0/1 Knapsack problem | Dynamic Programming