activity
20112026
most citedGILP: An Interactive Tool for Visualizing the Simplex Algorithm

7 citations · 12 across the 22 of their papers we have counts for

collaborators
Showing 2022 · cs.DSShow all

1 paper · 2 filters

cs.DS2022

A 4/3-Approximation Algorithm for Half-Integral Cycle Cut Instances of the TSP

Billy Jin, Nathan Klein, David P. Williamson

A long-standing conjecture for the traveling salesman problem (TSP) states that the integrality gap of the standard linear programming relaxation of the TSP is at most 4/3. Despite…