A 4/3-Approximation Algorithm for Half-Integral Cycle Cut Instances of the Traveling Salesman Problem
b'David Williamson speaking at the BIRS workshop 23w5140: Approximation Algorithms and the Hardness of Approximation (Sep 17 - Sep 22). Recorded by the Banff International Research Station for Mathematical Innovation and Discovery.'