Skip to content

Improved Approximation Algorithms for Prize-Collecting Steiner Tree and TSP

About this video

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

Presents improved approximation algorithms for prize-collecting Steiner tree and TSP. Teaches algorithmic techniques and analysis for NP-hard combinatorial optimization problems.

Video by Microsoft Research, played through YouTube's embedded player.