David P. Williamson is the Chair of the Department of Information Science at Cornell University, and a Professor in the School of Operations Research and Information Engineering.
He received his Ph.D. in Computer Science from MIT under Professor Michel X. Goemans in 1993. After a postdoc at Cornell under Professor Éva Tardos, he was a Research Staff Member for IBM Research at the T.J. Watson Research Center in Yorktown Heights, New York. From 2000 to 2003, he was the Senior Manager of the Computer Science Principles and Methodologies group at IBM’s Almaden Research Center in San Jose, California. He moved to Cornell University in 2004.
His research focuses on finding efficient algorithms for hard discrete optimization problems, with a focus on approximation algorithms for problems in network design, facility location, and scheduling. Other interests include algorithms for information networks.
PhD in Computer Science, 1993
SM in Computer Science, 1990
SB in Mathematics, 1989
An Experimental Evaluation of Semidefinite Programming and Spectral Algorithms for Max Cut
ACM Journal of Experimental Algorithmics 28. Article 2.1, pages 1-18, 2023.
A Combinatorial Cut-Toggling Algorithm for Solving Laplacian Linear Systems
To appear in Algorithmica.
Fluid Approximations for Revenue Management under High-Variance Demand: Good and Bad Formulations
Management Science 69:3759-4361, 2023.
A 4/3-Approximation Algorithm for Half-Integral Cycle Cut Instances of the TSP
In Albert Del Pia and Volker Kaibel, editors, Lecture Notes in Computer Science volume 13904, Integer Programming and Combinatorial Optimization (IPCO 2023), pages 217-230, 2023.
GILP: An Interactive Tool for Visualizing the Simplex Algorithm
In the SIGCSE 2023: Proceedings of the 54th ACM Technical Symposium on Computer Science Education, pages 108-114, 2023.