Approximating ATSP by Relaxing Connectivity

About this video

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

Presents approximation algorithms for the asymmetric traveling salesman problem via connectivity relaxation. Teaches a specific algorithmic technique and complexity analysis.

A 45-minute video from Microsoft Research: “Approximating ATSP by Relaxing Connectivity”.

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