About 22,900 results
www-math.mit.edu/~goemans/Leighton Family Professor of Mathematics. Contact info. MIT, Room 2-474.
Department of Mathematics Cambridge, MA 02139. USA Phone: 617-253-2688.
Fax: 617-253-4358 "lastname"@math.mit.edu. To book a short appointment, click
here. site info. © 2009 Michel Goemans | Original design by Andreas Viklund.
math.mit.edu/~goemans/publ.htmlA. Asadpour, M.X. Goemans, A. Madry, S. Oveis Gharan and A. Saberi, An O(log
n/log log n)-approximation algorithm for the asymmetric traveling salesman
problem , 21st ACM-SIAm Symposium on Discrete Algorithms, 2010. (Best paper
award.) pdf. M.X. Goemans, S. Iwata and R. Zenklusen, An Algorithmic
Framework for ...
people.csail.mit.edu/goemans/Michel X. Goemans. I am a Professor of Mathematics at MIT. I am also a member
of the Theory of Computation Group of the MIT Computer Science and Artificial
Intelligence Laboratory. This page is not maintained and my current homepage
can be found here .
https://scholar.google.com/citations?user=nf_EnbAAAAAJImproved approximation algorithms for maximum cut and satisfiability problems
using semidefinite programming. MX Goemans, DP Williamson. Journal of the
ACM (JACM) 42 (6), 1115-1145, 1995. 3103, 1995. A general approximation
technique for constrained forest problems. MX Goemans, DP Williamson. SIAM
https://en.wikipedia.org/wiki/Michel_GoemansMichel Xavier Goemans (born December, 1964) is a Belgian-American professor
of applied mathematics at MIT working in discrete mathematics and combinatorial
optimization. Goemans is a Fellow of the Association for Computing Machinery (
2008), a fellow of the American Mathematical Society (2012), and a fellow of the ...
dblp.uni-trier.de/pers/g/Goemans:Michel_X=List of computer science publications by Michel X. Goemans.
Michel Goemans, Klaus Jansen, Jose D.P. Rolim - 2003 - Mathematics
Michel X. Goemans MIT, Dept. of Mathematics, Room 2-351, Cambridge, MA
02139, email@example.com Abstract. A number of ... M.X. Goemans and D.P.
Williamson, “Approximation Algorithms for MAX 3-CUT and Other Problems Via
Complex Semidefinite Programming”, in the Proceedings of the 33rd Symposium
Mechthild Stoer - 2006 - Mathematics
|GB90] [GH61] [GJ79] [GLS88] [GM90] (GMS) (GMS91] IGMS92a) (GMS92b) (
GMS92c] [Goeg1a) [Goeg1b) [GP85 [GP86 M. X. Goemans and D. J. Bertsimas.
Survivable networks, linear programming relaxations and the parsimonious
property. Technical Report OR 216-90, Center for Operations Research, MIT,
1994 - Science
 M. X. Goemans and D. J. Bertsimas. Survivable networks, linear programming
relaxations and the parsimonious property. Mathematical Programming, 60, 1993
. Also appears as MIT Tech Report OR 216-90.  M. X. Goemans and D. P.
Williamson. A general approximation technique for constrained forest problems.
Klaus Jansen, Samir Khuller - 2003 - Computers
MIT Press, 1990.  C. W. Duin. Steiner's Problem in Graphs. PhD thesis,
Amsterdam University, 1993.  H. N. Gabow, M. X. Goemans, and D. P.
Williamson. An efficient approximation algorithm for the survivable network
design problem. In Proceedings 3rd Symposium on Integer Programming and
Combinatorial Opt., ...
Michel Xavier Goemans is a Belgian-American professor of applied mathematics at MIT working in discrete mathematics and combinatorial optimization. Wikipedia
Born: December 1964
Education: Massachusetts Institute of Technology (1990)
Academic advisor: Dimitris Bertsimas