Skip to content

ACM Fellows 2009 and Operations Research

ACM has announced its 2009 class, consisting of 47 new fellows.  Two of the fellows (at least!) have overlaps with operations research.

Andrew V. Goldberg of Microsoft Research was recognized “For contributions to fundamental theoretical and practical problems in the design and analysis of algorithms”.  Goldberg has a very nice set of codes for network optimization that is used quite a bit in the world of operations research.

David Karger of MIT was recognized “For efficient algorithms for combinatorial optimization problems  based on randomization”. Two of his papers in this topic appeared in Mathematics of Operations Research, and randomized rounding is one of the really nice ideas that have come out of approximation algorithms over the past years.

Congratulations to Andrew, David and the rest of the new ACM Fellows!

Share Your Views!

Your email is never published nor shared. Please do not enter non-operations research websites: just leave blank if not OR. COMMENTS WITH NON-OR WEBSITES WILL BE MARKED AS SPAM AND DELETED! Required fields are marked *