David P. Williamson is a Professor at Cornell University 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
Budgeted Prize-Collecting Traveling Salesman and Minimum Spanning Tree Problems
To appear in Mathematics of Operations Research
Characterizing the Integrality Gap of the Subtour LP for the Circulant Traveling Salesman Problem
To appear in the SIAM Journal on Discrete Mathematics
Tight Bounds for Online Weighted Tree Augmentation
In Christel Baier, Ioannis Chatzigiannakis, Paola Flochinni, and Stefano Leonardi, editors, 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019) , 88:1-88:14, 2019.