[+] Solving hard problems - structured inputs and Treewidth |
We continue the discussion of NP-Hard problems that can be solved efficiently if we assume the input is restricted in some way. We discuss facility location on trees, partition on powers of two, interval graphs, mention other graph families, and move on to define treewidth. |
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.