World's Best Scientists 2026 revealed!
Michel X. Goemans

Michel X. Goemans

D-Index & Metrics

Computer Science

D-Index
53
Citations
17740
World Ranking
4705
National Ranking
2185

Mathematics

D-Index
53
Citations
17743
World Ranking
883
National Ranking
424

Research.com Recognitions

  • 2013 - SIAM Fellow For contributions to combinatorial optimization, and in particular to the design and analysis of approximation algorithms.
  • 2013 - Fellow of the American Mathematical Society
  • 2008 - ACM Fellow For contributions to the theory of approximation algorithms and mathematical programming.
  • 2007 - Fellow of John Simon Guggenheim Memorial Foundation
  • 1995 - Fellow of Alfred P. Sloan Foundation

Overview

Michel X. Goemans is affiliated with MIT in the United States and contributes to the fields of Computer Science, Mathematics, and Engineering. Their research spans several subfields including Industrial and Manufacturing Engineering, Computational Theory and Mathematics, Statistics and Probability, Artificial Intelligence, and Discrete Mathematics and Combinatorics.

The scientist's work explores a variety of topics, with publications addressing Complexity and Algorithms in Graphs, Random Matrices and Applications, Stochastic Gradient Optimization Techniques, Optimization and Packing Problems, Advanced Manufacturing and Logistics Optimization, Scheduling and Optimization Algorithms, and Limits and Structures in Graph Theory.

Recent papers include the following:

  • Polynomiality for Bin Packing with a Constant Number of Item Types, 2020, Journal of the ACM
  • Shrunk subspaces via operator Sinkhorn iteration, 2022, arXiv (Cornell University)

Frequently collaborating with other researchers, Goemans has coauthored work with Cole Franks, Tasuku Soma, and Thomas Rothvoß.

Key venues where their research has been published include:

  • Journal of the ACM
  • arXiv (Cornell University)

Michel X. Goemans has received several recognitions throughout their career, including:

  • SIAM Fellow (2013) for contributions to combinatorial optimization, particularly in approximation algorithms design and analysis
  • Fellow of the American Mathematical Society (2013)
  • ACM Fellow (2008) for contributions to the theory of approximation algorithms and mathematical programming
  • Fellow of John Simon Guggenheim Memorial Foundation (2007)
  • Fellow of Alfred P. Sloan Foundation (1995)

Best Publications

  • Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming

    Michel X. Goemans;David P. Williamson

  • A General Approximation Technique for Constrained Forest Problems

    Michel X. Goemans;David P. Williamson

  • Approximating the value of two power proof systems, with applications to MAX 2SAT and MAX DICUT

    U. Feige;M. Goemans

  • Approximation algorithms for disjoint paths problems

    Jon Michael Kleinberg;Michel X. Goemans

  • The primal-dual method for approximation algorithms and its application to network design problems

    Michel X. Goemans;David P. Williamson

  • Approximating the Stochastic Knapsack Problem: The Benefit of Adaptivity

    Brian C. Dean;Michel X. Goemans;Jan Vondrák

  • An O(log n/log log n)-Approximation Algorithm for the Asymmetric Traveling Salesman Problem

    Arash Asadpour;Michel X. Goemans;Aleksander Mądry;Shayan Oveis Gharan

  • A note on the prize collecting traveling salesman problem

    Daniel Bienstock;Michel X. Goemans;David Simchi-Levi;David Williamson

  • Semidefinite programming in combinatorial optimization

    Michel X. Goemans

  • An improved approximation ratio for the minimum latency problem

    Michel X. Goemans;Jon M. Kleinberg

  • Market sharing games applied to content distribution in ad hoc networks

    M.X. Goemans;Li Li;V.S. Mirrokni;M. Thottan

  • Tight approximation algorithms for maximum general assignment problems

    Lisa Fleischer;Michel X. Goemans;Vahab S. Mirrokni;Maxim Sviridenko

  • Improved approximation algorithms for network design problems

    M. X. Goemans;A. V. Goldberg;S. Plotkin;D. B. Shmoys

  • New ${f rac{3}{4}}$-Approximation Algorithms for the Maximum Satisfiability Problem

    Michel X. Goemans;David P. Williamson

  • A primal-dual approximation algorithm for generalized steiner network problems

    David P. Williamson;Michel X. Goemans;Milena Mihail;Vijay V. Vazirani

  • .879-approximation algorithms for MAX CUT and MAX 2SAT

    Michel X. Goemans;David P. Williamson

  • On the single-source unsplittable flow problem

    Yefim Dinitz;Naveen Garg;Michel X. Goemans

  • Survivable networks, linear programming relaxations and the parsimonious property

    Michel X. Goemans;Dimitris J. Bertsimas

  • Sink equilibria and convergence

    M. Goemans;Vahab Mirrokni;A. Vetta

  • A Catalog of Steiner Tree Formulations

    Michel X. Goemans;Young-Soo Myung

  • Approximating the stochastic knapsack problem: the benefit of adaptivity

    B.C. Dean;M.X. Goemans;J. Vondrdk

  • Primal-Dual Approximation Algorithms for Integral Flow and Multicut in Trees, with Applications to Matching and Set Cover

    Naveen Garg;Vijay V. Vazirani;Mihalis Yannakakis

  • Tight Approximation Algorithms for Maximum Separable Assignment Problems

    Lisa Fleischer;Michel X. Goemans;Vahab S. Mirrokni;Maxim Sviridenko

Frequent Co-Authors

David P. Williamson
David P. Williamson Cornell University
Vahab Mirrokni
Vahab Mirrokni Google (United States)
Jan Vondrák
Jan Vondrák Stanford University
Éva Tardos
Éva Tardos Cornell University
Harold N. Gabow
Harold N. Gabow University of Colorado Boulder
Amin Saberi
Amin Saberi Stanford University
Michael Rosenblum
Michael Rosenblum University of California, San Francisco
Vahid Tarokh
Vahid Tarokh Duke University

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

For students pursuing Mathematics in the USA, exploring related online degrees can open doors to diverse career opportunities. Many graduates complement their math skills with a masters degree in marketing, which combines quantitative analysis with strategic business insights, making them valuable in fast-growing sectors.

Additionally, students often consider advancing their managerial capabilities through a one year mba program. These accelerated programs are ideal for math graduates seeking leadership roles without lengthy time commitments.

For those concerned about course flexibility, especially if they've completed prior graduate coursework, understanding can you transfer credits into an mba program is essential. This allows for reduced study time and optimized educational investment.

Moreover, a master in data analytics is a highly relevant path for math students. This degree equips individuals with the technical skills needed for data-driven decision-making in various industries, enhancing employability and earning potential.

Best Scientists Citing Michel X. Goemans

Trending Scientists

Recently Published Articles