David Applegate | Academic Influence

David Applegate's AcademicInfluence.com Rankings

David Applegate

Computer Science

#1608

World Rank

#1663

Historical Rank

#786

USA Rank

computer-science Degrees

David Applegate

Mathematics

#2952

World Rank

#4448

Historical Rank

#1126

USA Rank

Geometry

#185

World Rank

#261

Historical Rank

#35

USA Rank

Measure Theory

#2136

World Rank

#2579

Historical Rank

#614

USA Rank

mathematics Degrees

Download Badge

Computer Science
Mathematics

David Applegate's Degrees

PhD Computer Science Princeton University
Masters Computer Science Princeton University
Bachelors Mathematics University of Chicago

Similar Degrees You Can Earn

Why Is David Applegate Influential?

(Suggest an Edit or Addition)

According to Wikipedia, David L. Applegate is an American computer scientist known for his research on the traveling salesperson problem. Education Applegate graduated from the University of Dayton in 1984, and completed his doctorate in 1991 from Carnegie Mellon University, with a dissertation on convex volume approximation supervised by Ravindran Kannan.

(See a Problem?)

David Applegate's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

The Traveling Salesman Problem: A Computational Study (2007) (1760)
A Computational Study of the Job-Shop Scheduling Problem (1991) (925)
The Traveling Salesman Problem: A Computational Study (Princeton Series in Applied Mathematics) (2007) (522)
On the Solution of Traveling Salesman Problems (1998) (339)
Chained Lin-Kernighan for Large Traveling Salesman Problems (2003) (320)
Finding Cuts in the TSP (A preliminary report) (1995) (189)
A fast and scalable radiation hybrid map construction and integration strategy. (2000) (183)
Sampling and integration of near log-concave functions (1991) (179)
Implementing the Dantzig-Fulkerson-Johnson algorithm for large traveling salesman problems (2003) (172)
Certification of an optimal TSP tour through 85, 900 cities (2009) (150)
Solution of a Min-Max Vehicle Routing Problem (2002) (138)
TSP Cuts Which Do Not Conform to the Template Paradigm (2000) (137)
Exact solutions to linear programming problems (2007) (117)
The traveling salesman problem (2006) (87)
Finding Tours in the TSP (1999) (86)
Solving Large-Scale Matching Problems (1991) (40)
The Cutting-Stock Approach to Bin Packing: Theory and Experiments (2003) (22)
Practical Large-Scale Linear Programming using Primal-Dual Hybrid Gradient (2021) (20)
Computer analysis of Sprouts (1999) (20)
Lower bounds for the total stopping time of 3x + 1 iterates (2001) (20)
Density bounds for the 3x + 1 problem. II: Krasikov inequalities (1995) (19)
On asymmetric coverings and covering numbers (2002) (19)
Density bounds for the 3x + 1 problem. I: tree-search method (1995) (18)
The Distribution of 3x+1 Trees (1995) (17)
Faster first-order primal-dual methods for linear programming using restarts and sharpness (2021) (15)
The 3x + 1 semigroup (2004) (10)
Infeasibility detection with primal-dual hybrid gradient for large-scale linear programming (2021) (10)
Integral infeasibility and testing total dual integrality (1991) (9)
The Toothpick Sequence and Other Sequences from Cellular Automata (2010) (8)
Dismal Arithmetic (2011) (6)
2007 Proceedings of the Ninth Workshop on Algorithm Engineering and Experiments (ALENEX) (2007) (4)
The Gift Exchange Problem (2009) (4)
Analysis of the Gift Exchange Problem (2017) (3)
The Yellowstone Permutation (2015) (3)
Cutting planes and the traveling salesman problem (abstract only) (2000) (2)
Carryless Arithmetic Mod 10 (2010) (2)
Descending Dungeons and Iterated Base-Changing (2006) (1)
Sampling, integration, and computing volumes (1992) (1)
Intellectual Property Hot News : The “ Hot-News ” Doctrine Is Hot Again ! Or Is It ? (2011) (1)
DENSITY BOUNDS FOR THE 3 x + 1 PROBLEM . II (2010) (1)
A Practical Guide to Discrete Optimization Dynamic Programming , 29 December 2014 (2014) (1)
Some Problems in Probabilistic Tomography (1997) (1)
Alenex workshop preface (2005) (0)
Some problems in probabilistic tomography@@@Some problems in probabilistic tomography (1996) (0)
Carryless Arithmetic (I): The Mod 10 Version (2010) (0)
ELDRED V. ASHCROFT: JUST ANOTHER MICKEY MOUSE COPYRIGHT CASE? (2002) (0)
TSP cuts outside the template paradigm (2000) (0)
C O ] 2 8 M ay 2 00 2 On Asymmetric Coverings and Covering Numbers (2013) (0)
Sloping Binary Numbers: A New Sequence Related to the Binary Numbers (2005) (0)
The Distribution of 3 x + 1 Trees (2007) (0)
N ov 2 00 6 Descending Dungeons and Iterated Base-Changing (2006) (0)
N T ] 1 4 Fe b 20 07 Descending Dungeons and Iterated Base-Changing (2006) (0)
Martin Gardner in the Twenty-First Century: Carryless Arithmetic Mod 10 (2012) (0)
Proceedings of the Nine Workshop on Algorithm Engineering and Experiments, ALENEX 2007, New Orleans, Louisiana, USA, January 6, 2007 (2007) (0)
George Pólya Awards for 2013 (2014) (0)

This paper list is powered by the following services:

Other Resources About David Applegate

en.wikipedia.org

What Schools Are Affiliated With David Applegate?

David Applegate is affiliated with the following schools: