Two-dimensional gantt charts and a scheduling algorithm of lawler
- Michel X. Goemans
- David P. Williamson
- 2000
- SIAM Journal on Discrete Mathematics
Publications
This is our catalog of publications authored by IBM researchers, in collaboration with the global research community. It’s an ever-growing body of work that shows why IBM is one of the most important contributors to modern computing.
Date
Featured collections
Popular topics
29 results for David P. Williamson
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
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
Short shop schedules
- D.P. Williamson
- L.A. Hall
- et al.
- 1997
- Operations Research
On the number of small cuts in a graph
- Monika Henzinger
- David P. Williamson
- 1996
- Information Processing Letters
Computational experience with an approximation algorithm on large-scale euclidean matching instances
- David P. Williamson
- Michel X. Goemans
- 1996
- INFORMS Journal on Computing
A primal-dual approximation algorithm for generalized steiner network problems
- David P. Williamson
- Michel X. Goemans
- et al.
- 1995
- Combinatorica