[+] Approximation Algorithms |
| In this lecture we continue our discussion of approximation algorithms. We present approximation algorithms for Euclidean TSP and Bin-Packing, and start working towards a polynomial-time approximation scheme (PTAS) for Knapsack. |
|
Download Video: 720p |
[No lecture notes for this lecture.] |
The video above should play if your web browser supports either modern Flash or HTML5 video with H.264 or WebM codec. The lecture notes should advance automatically. If you have any trouble with playback, email me.