Goemans, Michel X.
Massachusetts Institute of Technology
2 papers on CoChat
Most cited papers
- Verified
Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
Goemans, M. X., & Williamson, D. P. (1995) · Journal of the ACM
Complexity and Algorithms in GraphsAdvanced Optimization Algorithms Research
Cited by 3,587
- Verified
Tight Approximation Algorithms for Maximum Separable Assignment Problems
Fleischer, L., Goemans, M. X., Mirrokni, V. S., & Sviridenko, M. (2011) · Mathematics of Operations Research
Complexity and Algorithms in GraphsOptimization and Packing Problems
Cited by 65
Go further with a free account
Verify every reference, keep papers in a library, and ask questions across them.
Sign up - it is free