6.889: Algorithms for Planar Graphs and Beyond (Fall 2011)

Erik Demaine, Shay Mozes, Christian Sommer, Siamak Tazari

[Home] [Problem Sets] [Project] [Lectures] [Problem Session Notes] [Klein's Book] [Accessibility]

Lecture 17 Video     [previous] [next]

[+] PTAS for planar subset-connectivity problems II: Structure theorem for Steiner tree

Following up on Lecture 16, we prove the structure theorem for Steiner tree, which is the heart of the correctness of the PTAS.

Download Video: 360p, 720p

Lecture notes, page 1/12 • [previous page] • [next page] • [PDF]

Lecture notes, page 1/12 • [previous page] • [next page] • [PDF]

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 Erik.