2 papers
cs.DS2026
Maximum Entropy is a 10/7-Approximation Algorithm for the TSP on Half-Integral Cycle Cut Instances
Billy Jin, Nathan Klein, David P. Williamson
One of the most famous conjectures in combinatorial optimization is the four-thirds conjecture, which states that the integrality gap of the Subtour LP relaxation of the TSP is equ…
cs.DS2025
A Lower Bound for the Max Entropy Algorithm for TSP
Billy Jin, Nathan Klein, David P. Williamson
One of the most famous conjectures in combinatorial optimization is the four-thirds conjecture, which states that the integrality gap of the subtour LP relaxation of the TSP is equ…