David P. Williamson
Home
Posts
Publications
Talks
Courses
Contact
CV
Anke van Zuylen
Latest
Greedy Algorithms for the Maximum Satisfiability Problem: Simple Algorithms and Inapproximability Bounds
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 Some Recent Approximation Algorithms for MAX SAT
Popular ranking
On the integrality gap of the Subtour LP for the 1,2-TSP
A proof of the Boyd-Carr conjecture
Popular ranking
Deterministic Pivoting Algorithms for Constrained Ranking and Clustering Problems.
A Simpler and Better Derandomization of an Approximation Algorithm for Single Source Rent-or-Buy.
Cite
×