Skip to content

Lecture -26 NP-Completeness-I -Motivation

nptelhrd2.25M subscribers

About this video

Hand-picked by a BrighterTube curator · found via round-3 back catalogue of a channel Lumen picks video by video

This lecture covers approximation algorithms for NP-complete problems. It teaches techniques for solving hard problems with provable solution quality.

Video by nptelhrd, played through YouTube's embedded player.

Part of Computer - Design and Analysis of Algorithms