David P. Williamson
Home
Posts
Publications
Talks
Courses
Contact
CV
Traveling Salesman Problem
The Unbounded Integrality Gap of a Semidefinite Relaxation of the Traveling Salesman Problem
Prize-Collecting TSP with a Budget Constraint
An Experimental Evaluation of the Best-of-Many Christofides' Algorithm for the Traveling Salesman Problem
An Experimental Evaluation of the Best-of-Many Christofides' Algorithm for the Traveling Salesman Problem
On the Integrality Gap of the Subtour LP for the 1,2-TSP
2-Matchings, the Traveling Salesman Problem, and the Subtour LP: A Proof of the Boyd-Carr Conjecture
On the integrality gap of the Subtour LP for the 1,2-TSP
A proof of the Boyd-Carr conjecture
A faster, better approximation algorithm for the minimum latency problem.
A note on the prize-collecting traveling salesman problem.
«
»
Cite
×