Class Central is learner-supported. When you buy through links on our site, we may earn an affiliate commission.

YouTube

Hardness of Approximation - Part 1

Ryan O'Donnell via YouTube

Start learning Write review
Coursera Ad

Learn AI, Data Science & Business — Earn Certificates That Get You Hired

Learn More → Scrimba Ad

Get 20% off all career paths from fullstack to AI

Learn More →

Overview

Google, IBM & Meta Certificates – 40% Off
One Coursera Plus subscription covers most Professional Certificates on Coursera.
Unlock All Certificates
This lecture introduces approximation guarantees and the complexity-theoretic foundations of hardness-of-approximation results. It uses Max-Cut, Max-3LIN, Maximum Independent Set, Max-K-Cover, and projection games as examples.

Syllabus

Introduction
Max Cuts On
Basic Decision
Maximum Independent Set
Max K Cover
Questions
Max Code
Key Definition
Approximation
Greedy algorithm
Best known algorithms
State of affairs
Unique games conjecture
Approximability results
Proof
Notation
More questions

Taught by

Ryan O'Donnell

Reviews

Start your review of Hardness of Approximation - Part 1

Start learning

Never Stop Learning.

Get personalized course recommendations, track subjects and courses with reminders, and more.

Sign up for free
Someone learning on their laptop while sitting on the floor.