David P. Williamson

David Paul Williamson (born April 2, 1967 ) is an American mathematician and computer scientist who specializes in mathematical optimization , computer science and operations research . He is a professor at Cornell University .

Education and career

From left: Torben Hagerup, Susanne Albers, David P. Williamson, Kurt Mehlhorn , Oberwolfach 2003

Williamson received his bachelor's degree in mathematics in 1989 and his master's degree in computer science from the Massachusetts Institute of Technology in 1990 , from which he received his PhD in 1993 under Michel Goemans (On the design of approximation algorithms for a class of graph problems). As a post-doctoral student , he was with Éva Tardos at Cornell University and then at the IBM Thomas J. Watson Research Center . From 2000 to 2003 he was Senior Manager of the Computer Science Principles and Methodologies Group at IBM's Almaden Research Center . From 2004 he was a professor at Cornell University.

research

With Goemans he found an approximation algorithm for the Max Cut problem. He also developed approximation algorithms for other operations research problems, such as the traveling salesman problem and scheduling .

He is editor of the SIAM Journal of Discrete Mathematics.

Awards and honors

1994: A. W. Tucker Prize
2000: Fulkerson Prize (with Michel Goemans )
1999: SIAM Group of Optimization Prize
2010: Humboldt Research Award
2013: Frederick W. Lanchester Prize
since 2013: Fellow of the Association for Computing Machinery

Fonts

with David Shmoys : The Design of Approximation Algorithms, Cambridge University Press 2011
with Guolong Lin, Chandrashekhar Nagarajan, Rajmohan Rajaraman: A General Approach for Incremental Approximation and Hierarchical Clustering , SIAM Journal on Computing, Volume 39, 2010, pp. 3633-3669.
with Mateo Restrepo: A Simple GAP-Canceling Algorithm for the Generalized Maximum Flow Problem , Mathematical Programming, Volume 118, 2009, pp. 47-74.
with Anke van Zuylen Deterministic Pivoting Algorithms for Constrained Ranking and Clustering Problems , Mathematics of Operations Research, Volume 34, 2009, pp. 594–620.
with Yogeshwer Sharma: Stackelberg Thresholds in Network Routing Games or the Value of Altruism , Games and Economic Behavior, Volume 67, 2009, pp. 174-190.
mit Goemans: Improved approximation algorithms for the maximum cut and satisfiability problems using semi-definite programming , Journal of the ACM, Vol. 42, 1995, pp. 1115-1145

Web links

Homepage

Individual evidence

↑ David P. Williamson in the Mathematics Genealogy Project (English)
↑ nav = tucker # winners Tucker Prize
^ Frederick W. Lanchester Prize. (No longer available online.) Informs.org ( Institute for Operations Research and the Management Sciences ), archived from the original on October 2, 2015 ; accessed on February 16, 2016 . Info: The archive link was inserted automatically and has not yet been checked. Please check the original and archive link according to the instructions and then remove this notice. @1@ 2

personal data
SURNAME	Williamson, David P.
ALTERNATIVE NAMES	Williamson, David Paul (full name)
BRIEF DESCRIPTION	American mathematician and computer scientist
DATE OF BIRTH	April 2, 1967

[1] David P. Williamson in the Mathematics Genealogy Project (English)

[2] v = tucker # winners Tucker Prize

[Lanchester-Preis-3] Frederick W. Lanchester Prize. (No longer available online.) Informs.org ( Institute for Operations Research and the Management Sciences ), archived from the original on October 2, 2015 ; accessed on February 16, 2016 . Info: The archive link was inserted automatically and has not yet been checked. Please check the original and archive link according to the instructions and then remove this notice. @1@ 2