[+] Polynomial time approximation shchemes, and Solving hard problems on structured instances |
| We discuss a polynomial time approximation scheme (PTAS) for the knapsack problem. We then discuss problems that are NP-Hard, but can be solved efficiently if we assume the input is restricted in some way. Examples include minimum independent set on trees using greedy and dynamic programming algorithms, the partition problem on powers of two, facility location problems on trees, and maximum independent set on interval graphs. |
|
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.