Session 1A - Bipartite TSP in O(1.9999ⁿ) Time, Assuming Quadratic Time Matrix Multiplication

About this video

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

Presents an algorithm for bipartite TSP with exponential-time bounds. Demonstrates a combinatorial optimization approach.

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

Part of STOC 2020