David Shmoys | |
---|---|
![]() David Shmoys | |
Born | 1959 (age 64–65) |
Alma mater | Princeton, University of California, Berkeley |
Awards | Frederick W. Lanchester Prize (2013) Daniel H. Wagner Prize (2018) Khachiyan Prize (2022) |
Scientific career | |
Fields | Computer Science, Computational complexity theory |
Institutions | Cornell |
Thesis | Approximation Algorithms for Problems in Sequencing, Scheduling, and Communication Network Design (1984) |
Doctoral advisor | Eugene Lawler |
Doctoral students | Clifford Stein |
Website | people |
David Bernard Shmoys (born 1959) is a Professor in the School of Operations Research and Information Engineering and the Department of Computer Science at Cornell University. He obtained his Ph.D. from the University of California, Berkeley in 1984. His major focus has been in the design and analysis of algorithms for discrete optimization problems.
In particular, his work has highlighted the role of linear programming in the design of approximation algorithms for NP-hard problems. He is known for his pioneering research on providing first constant factor performance guarantee for several scheduling and clustering problems including the k-center and k-median problems and the generalized assignment problem. Polynomial-time approximation schemes that he developed for scheduling problems have found applications in many subsequent works. His current research includes stochastic optimization for data-driven models in a broad cross-section of areas, including COVID epidemiological modeling, congressional districting, transportation, and IoT network design. Shmoys is married to Éva Tardos, who is the Jacob Gould Schurman Professor of Computer Science at Cornell University.