A Randomized O(log n)-Competitive Algorithm for the Online Connected Facility Location Problem
Mário César San Felice, David P. Williamson, and Orlando Lee
Algorithmica 76:1139-1157, 2016.
An Experimental Evaluation of Fast Approximation Algorithms for the Maximum Satisfiability Problem
Matthias Poloczek and David P. Williamson
In Andrew V. Goldberg and Alexander S. Kulikov, editors, Lecture Notes in Computer Science Number 9685, Experimental Algorithms, 15th International Symposium, SEA 2016 pages 246-261, 2016
Simple Approximation Algorithms for Balanced MAX 2SAT
Alice Paul, Matthias Poloczek, and David P. Williamson
In Evangelos Kranakis, Gonzalo Navarro, and Edgar Chávez, editors, Lecture Notes in Computer Science Number 9644, LATIN 2016: Theoretical Informatics, pages 659-671, 2016.
The Subtour LP for the Traveling Salesman Problem
University of Illinois, Industrial and Enterprise Systems Engineering. Champaign, IL, USA.
April 21, 2016.
A Simple 3/4-Approximation Algorithm for the Maximum Satisfiability Problem
University of Pennsylvania, Theory CS Seminar. Philadelphia, PA, USA.
April 01, 2016.
An Experimental Evaluation of the Best-of-Many Christofides' Algorithm for the Traveling Salesman Problem
6th Workshop on Combinatorial Optimization. Cargèse, Corsica, France.
September 17, 2015.
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.
His graduated Ph.D. students are:
- Anke van Zuylen, June 2008 (Assistant Professor, William and Mary Math)
- Chandrashekhar Nagarajan, August 2008 (Facebook)
- Yogeshwer Sharma, August 2010 (Facebook)
- Jiawei Qian, January 2012 (Ping An Securities)
- James Davis, August 2015 (Assistant Professor, University of Illinois Industrial Engineering)
- Sin-Shuen Cheung, January 2016 (Bank of America)
His current Ph.D. students are:
- Alice Paul (graduating summer 2017)