David Applegate
David Applegate | |
|---|---|
| Academic background | |
| Education | University of Dayton (BS) Carnegie Mellon University (PhD) |
| Ravindran Kannan | |
| Academic work | |
| Discipline | Computer science |
Sub-discipline | Convex volume approximation |
| Institutions | Rice University AT&T Labs |
David L. Applegate is an American computer scientist known for his research on the traveling salesperson problem.
Education
[edit ]Applegate graduated from the University of Dayton in 1984,[1] and completed his doctorate in 1991 from Carnegie Mellon University, with a dissertation on convex volume approximation supervised by Ravindran Kannan.[2]
Career
[edit ]Applegate worked on the faculty at Rice University and at AT&T Labs before joining Google in New York City in 2016.[1] His work on the Concorde TSP Solver, described in a 1998 paper, won the Beale–Orchard-Hays Prize of the Mathematical Optimization Society,[3] [1] [ICM] and his book The traveling salesman problem with the same authors won the Frederick W. Lanchester Prize in 2007.[4] [TSP] He and Edith Cohen won the IEEE Communications Society's William R. Bennett Prize for a 2006 research paper on robust network routing.[5] [ToN] Another of his papers, on arithmetic without carrying, won the 2013 George Pólya Award.[6] [CMJ] In 2013, he was named an AT&T Fellow.[1]
With Guy Jacobsen and Daniel Sleator, Applegate was the first to computerize the analysis of the pencil-and-paper game, Sprouts.[7] [8]
Selected publications
[edit ]References
[edit ]- 1 2 3 4 "David Applegate", Research at Google, retrieved 2017年08月03日
- ↑ David Applegate at the Mathematics Genealogy Project
- ↑ Past Winners of the Beale — Orchard-Hays Prize, Mathematical Optimization Society , retrieved 2017年08月03日.
- 1 2 "David L. Applegate", Recognizing Excellence: Award Recipients, Institute for Operations Research and the Management Sciences , retrieved 2017年08月03日
- 1 2 The IEEE Communications Society William R. Bennett Prize, retrieved 2017年08月03日
- 1 2 3 Applegate, David; Lebrun, Marc; Sloane, N. J. A. (2010), "Carryless Arithmetic Mod 10", George Pólya Awards, Mathematical Association of America, arXiv:1008.4633 , archived from the original on December 20, 2013, retrieved 2017年08月03日
- ↑ Gardner, Martin (2001), The Colossal Book of Mathematics: Classic Puzzles, Paradoxes, and Problems : Number Theory, Algebra, Geometry, Probability, Topology, Game Theory, Infinity, and Other Topics of Recreational Mathematics, W. W. Norton & Company, p. 491, ISBN 9780393020236
- ↑ Peterson, Ivars (2002), Mathematical Treks: From Surreal Numbers to Magic Circles, MAA Spectrum, Mathematical Association of America, p. 71, ISBN 9780883855379
- ↑ Lenstra, Jan Karel; Shmoys, David (2009), "The traveling salesman problem: a computational study", SIAM Review, 51 (4): 799–801, MR 2573947
External links
[edit ]- David Applegate publications indexed by Google Scholar