6.890 | Fall 2014 | Graduate

Algorithmic Lower Bounds: Fun with Hardness Proofs

Lecture Videos

Lecture 11: Inapproximability Examples

Description: In this lecture, Professor Demaine explains L-reductions to prove various problems APX-complete, introduces a characterization theorem for approximability, and mentions the approximation spectrum.

Instructor: Erik Demaine

A video player with synced slides and lecture notes is available.

Course Info

Instructor
Departments
As Taught In
Fall 2014
Level
Graduate
Topics
Learning Resource Types
Lecture Videos
Problem Sets with Solutions
Lecture Notes
Projects
Instructor Insights
Download Course
MIT Open Learning
Over 2,500 courses & materials
Freely sharing knowledge with learners and educators around the world. Learn more
© 2001–2024 Massachusetts Institute of Technology
Accessibility
Creative Commons License
Terms and Conditions
Proud member of:
© 2001–2024 Massachusetts Institute of Technology