Vector Representations of Graphs and the Maximum Cut Problem

Lecture

Speaker(s)

David P. Williamson

Professor, Operations Research and Information Engineering
Cornell University

David P. Williamson is a Professor in the School of Operations Research and Information Engineering at Cornell University. 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. 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.