David P. Williamson
Cornell University · 207 works · 12,098 citations · h-index 43
Top works
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- A General Approximation Technique for Constrained Forest Problems
- .879-approximation algorithms for MAX CUT and MAX 2SAT
- The Design of Approximation Algorithms
- New $\frac{3}{4}$-Approximation Algorithms for the Maximum Satisfiability Problem
- A note on the prize collecting traveling salesman problem
- Scheduling Parallel Machines On-Line
- The primal-dual method for approximation algorithms and its application to network design problems
- Iterative rounding 2-approximation algorithms for minimum-cost vertex connectivity problems
- A primal-dual approximation algorithm for generalized Steiner network problems
- Improved Approximation Algorithms for Capacitated Facility Location Problems
- Approximating the smallest k-edge connected spanning subgraph by LP-rounding
- Improved approximation algorithms for network design problems
- Short Shop Schedules
- Gadgets, Approximation, and Linear Programming
- A primal-dual approximation algorithm for generalized steiner network problems
- Adversarial queueing theory
- Analyzing the Held-Karp tsp bound: a monotonicity property with application
- Scheduling parallel machines on-line
- Searching the workplace web