Skip to content

A Constant-Factor Approximation Algorithm for the Asymmetric Traveling Salesman Problem

About this video

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

Constant-factor approximation for asymmetric traveling salesman demonstrates algorithmic techniques for NP-hard optimization. This teaches approximation theory.

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