An iterative rounding 2-approximation algorithm for the element connectivity problem
- Lisa Fleischer
- Kamal Jain
- et al.
- 2001
- Annual Symposium on Foundations of Computer Science - Proceedings
Publications
Date
Featured collections
Popular topics
29 results for David P. Williamson
Gadgets, approximation, and linear programming
- Luca Trevisan
- Gregory B. Sorkin
- et al.
- 2000
- SIAM Journal on Computing
1.47-Approximation algorithm for a preemptive single-machine scheduling problem
- Michel X. Goemans
- Joel M. Wein
- et al.
- 2000
- Operations Research Letters
Node-disjoint paths on the mesh and a new trade-off in VLSI layout
- Alok Aggarwal
- Jon Kleinberg
- et al.
- 2000
- SIAM Journal on Computing
The approximability of constraint satisfaction problems
- Sanjeev Khanna
- Madhu Sudan
- et al.
- 2000
- SIAM Journal on Computing
Two-dimensional gantt charts and a scheduling algorithm of lawler
- Michel X. Goemans
- David P. Williamson
- 2000
- SIAM Journal on Discrete Mathematics
Faster approximation algorithms for the minimum latency problem
- Aaron Archer
- David P. Williamson
- 1998
- SODA 1998
An efficient approximation algorithm for the survivable network design problem
- Harold N. Gabow
- Michel X. Goemans
- et al.
- 1998
- Mathematical Programming, Series B
Primal-dual approximation algorithms for feedback problems in planar graphs
- Michel X. Goemans
- David P. Williamson
- 1998
- Combinatorica
A primal-dual interpretation of two 2-approximation algorithms for the feedback vertex set problem in undirected graphs
- Fabián A. Chudak
- Michel X. Goemans
- et al.
- 1998
- Operations Research Letters