A Case Study in Applied Algorithm Design

This publication has 12 references indexed in Scilit:

• Programming pearls: Cracking the oyster
  Communications of the ACM, 1983
• Complete Convergence of Short Paths and Karp's Algorithm for the TSP
  Mathematics of Operations Research, 1981
• Subadditive Euclidean Functionals and Nonlinear Growth in Geometric Probability
  The Annals of Probability, 1981
• Optimal Expected-Time Algorithms for Closest Point Problems
  ACM Transactions on Mathematical Software, 1980
• The Changing Demography of the Central City
  Scientific American, 1980
• The Efficiency of Algorithms
  Scientific American, 1978
• An Analysis of Several Heuristics for the Traveling Salesman Problem
  SIAM Journal on Computing, 1977
• The Euclidean travelling salesman problem is NP-complete
  Theoretical Computer Science, 1977
• Geometric complexity
  Published by Association for Computing Machinery (ACM) ,1975
• The shortest path through many points
  Mathematical Proceedings of the Cambridge Philosophical Society, 1959