[+] Integer Linear programming, LP duality and a bit of Randomized algorithms |
| We discuss approximation algorithms for linear integer programs that use optimal solutions to the relaxation LP problem. We then introduce LP duality, and show an approximation algorithm based on the concept of complementary slackness. In the seconf half of the lecture we start discussing randomized algorithms. |
|
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.