David Applegate - Publications

  1. Random Polynomial Time Algorithm for Sampling from Joint Distributions, David L. Applegate, Ravi Kannan and Nick Polson, Department of Statistics, Carnegie Mellon University, 1990.
  2. A Computational Study of the Job-Shop Scheduling Problem, David L. Applegate and William Cook, ORSA Journal on Computing, 3:2 (Spring, 1991), pp. 149-156.
  3. Computer Analysis of Sprouts, David L. Applegate, Guy Jacobson and Daniel Sleator, School of Computer Science, Carnegie Mellon University, 1991.
  4. Integral Infeasibility and Testing Total Dual Integrality, David L. Applegate, William Cook and S. Thomas McCormick, Operations Research Letters, 10 (1991), pp. 37-41.
  5. Sampling and Integration of Near Log-Concave Functions, David L. Applegate and Ravi Kannan, Proceedings of the Twenty-third Annual ACM Symposium on Theory of Computing, 1991, pp. 156-163.
  6. Sampling, Integration, and Computing Volumes, David L. Applegate, School of Computer Science, Carnegie Mellon University, Pittsburgh, PA, December, 1991.
  7. Solving Large-Scale Matching Problems, David L. Applegate and William Cook, Network Flows and Matchings: First DIMACS Implementation Challenge, David S. Johnson and Catherine C. McGeoch (editors), American Mathematical Society, Providence, 1993, pp. 557-576.
  8. Lower Bounds for the Travelling Salesman Problem, David L. Applegate, Vasek Chvatal and William Cook, Proceedings of TSP 90, to appear.
  9. Density Bounds for the 3x+1 Problem I. Tree-Search Method, David L. Applegate and Jeffrey C. Lagarias, Mathematics of Computation, to appear.
  10. Density Bounds for the 3x+1 Problem II. Krasikov Inequalities, David L. Applegate and Jeffrey C. Lagarias, Mathematics of Computation, to appear.