The Online Connected Facility Location Problem
Mário César San Felice, David P. Williamson, and Orlando Lee
To appear in LATIN 2014
A 3/2-approximation algorithm for some minimum-cost graph problems
Basile Couëtoux, James M. Davis, and David P. Williamson
Mathematical Programming, to appear.
Offline and online facility leasing
Chandrashekhar Nagarajan and David P. Williamson
Discrete Optimization 10:361-370, 2013.
The Rank Aggregation Problem
InWeb Workshop, Universidade Federal de Minas Gerais. Belo Horizonte, Brazil.
December 10, 2012.
A 3/2-Approximation Algorithm for Some Minimum-Cost Graph Problems
International Symposium on Mathematical Programming. Berlin, Germany.
August 23, 2012.
The Subtour LP for the Traveling Salesman Problem
Universität Wien. Vienna, Austria.
June 18, 2012.
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, December 2011 (Bank of America)
His current Ph.D. students are:
- James Davis
- Alice Paul