Lecture Notes
Lecture 18
Description:
Lecture notes on approximation algorithms (max-cut), the generalized Steiner tree problem, the Goemans-Williamson algorithm, implementation, and generalizations.
Resource Type:
Lecture Notes
pdf
120 kB
Lecture 18
Course Info
Instructor
As Taught In
Fall
2008
Level
Learning Resource Types
notes
Lecture Notes
assignment_turned_in
Problem Sets with Solutions
