7 citations · 12 across the 22 of their papers we have counts for
3 papers · 1 filter
The Two-Stripe Symmetric Circulant TSP is in P
Samuel C. Gutekunst, Billy Jin, David P. Williamson
The symmetric circulant TSP is a special case of the traveling salesman problem in which edge costs are symmetric and obey circulant symmetry. Despite the substantial symmetry of t…
Subtour Elimination Constraints Imply a Matrix-Tree Theorem SDP Constraint for the TSP
Samuel C. Gutekunst, David P. Williamson
De Klerk, Pasechnik, and Sotirov give a semidefinite programming constraint for the Traveling Salesman Problem (TSP) based on the matrix-tree Theorem. This constraint says that the…
Rank Aggregation: New Bounds for MCx
Daniel Freund, David P. Williamson
The rank aggregation problem has received significant recent attention within the computer science community. Its applications today range far beyond the original aim of building m…