Tight approximation algorithms for maximum general assignment problems
- Lisa Fleischer
- Michel X. Goemans
- et al.
- 2006
- SODA 2006
Publications
Date
Featured collections
Popular topics
10 results for Michel X. Goemans
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
Improved Approximation Algorithms for Maximum Cut and Satisflability Problems Using Semidefinite Programming
- Michel X. Goemans
- David P. Williamson
- 1995
- Journal of the ACM (JACM)
Approximation algorithms for Max-3-Cut and other problems via complex semidefinite programming
- Michel X. Goemans
- David P. Williamson
- 2004
- Journal of Computer and System Sciences
Two-dimensional gantt charts and a scheduling algorithm of lawler
- Michel X. Goemans
- David P. Williamson
- 2000
- SIAM Journal on Discrete Mathematics
1.47-Approximation algorithm for a preemptive single-machine scheduling problem
- Michel X. Goemans
- Joel M. Wein
- et al.
- 2000
- Operations Research Letters
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
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