Skip to content

Session 1A - An Improved Approximation Algorithm for TSP in the Half Integral Case

746 views

About this video

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

Develops an improved approximation algorithm for traveling salesman problem in the half-integral relaxation. Presents a concrete algorithmic advance with rigorous approximation analysis.

Video by Association for Computing Machinery (ACM), played through YouTube's embedded player.

Part of STOC 2020