MPRI - Parisian Master of Research in Computer Science br Course 2.11.1: Approximation Algorithms, Randomization & Nature Programming br Nicolas SCHABANEL, CNRS - Université Paris Diderot br br LECTURE 4 (2016105) br POLYNOMIAL-TIME APPROXIMATION SCHEMES br br [0:00:00] 0. (F)PT(R)AS: (Fully) Polynomial-Time (Randomized) Approximation Schemes br [0:10:31] 1. A FPTAS for the Knapsack Problem br [1:05:27] 2.