6.854J | Fall 2008 | Graduate

Advanced Algorithms

Lecture Notes

Approximaion Algorithms: MAXCUT

Description:

Lecture notes on the MAX-CUT problem, local search, the random cut, LP relaxation, and SDP relaxation.

Resource Type:
Lecture Notes
pdf
201 kB
Approximaion Algorithms: MAXCUT

Course Info

As Taught In
Fall 2008
Level
Learning Resource Types
Lecture Notes
Problem Sets with Solutions