Dynamic Programming

  • Steven S. Skiena


The most challenging algorithmic problems involve optimization, where we seek to find a solution that maximizes or minimizes some function. Traveling salesman is a classic optimization problem, where we seek the tour visiting all vertices of a graph at minimum total cost. But as shown in Chapter 1, it is easy to propose “algorithms” solving TSP that generate reasonable-looking solutions but did not always produce the minimum cost tour.


Dynamic Programming Greedy Algorithm Dynamic Programming Algorithm Edit Distance Recursive Call 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [AP72]
    A. Aho and T. Peterson. A minimum distance error-correcting parser for context-free languages. SIAM J. Computing, 1:305–312, 1972.CrossRefzbMATHMathSciNetGoogle Scholar
  2. [Bel58]
    R. Bellman. On a routing problem. Quarterly of Applied Mathematics, 16:87–90, 1958.zbMATHMathSciNetGoogle Scholar
  3. [CLRS01]
    T. Cormen, C. Leiserson, R. Rivest, and C. Stein. Introduction to Algorithms. MIT Press, Cambridge MA, second edition, 2001.zbMATHGoogle Scholar
  4. [HWK94]
    T. He, S. Wang, and A. Kaufman. Wavelet-based volume morphing. In Proc. IEEE Visualization ’94, pages 85–92, 1994.Google Scholar
  5. [KMS97]
    S. Khanna, M. Muthukrishnan, and S. Skiena. Efficiently partitioning arrays. In Proc. ICALP ’97, volume 1256, pages 616–626. Springer-Verlag LNCS, 1997.Google Scholar
  6. [MR06]
    W. Mulzer and G. Rote. Minimum weight triangulation is NP-hard. In Proc. 22nd ACM Symp. on Computational Geometry, pages 1–10, 2006.Google Scholar
  7. [PSW92]
    T. Pavlides, J. Swartz, and Y. Wang. Information encoding with two-dimensional bar-codes. IEEE Computer, 25:18–28, 1992.CrossRefGoogle Scholar
  8. [WF74]
    R. A. Wagner and M. J. Fischer. The string-to-string correction problem. J. ACM, 21:168–173, 1974.CrossRefzbMATHMathSciNetGoogle Scholar
  9. [Woe03]
    G. Woeginger. Exact algorithms for NP-hard problems: A survey. In Combinatorial Optimization - Eureka! You shrink!, volume 2570 Springer-Verlag LNCS, pages 185–207, 2003.Google Scholar
  10. [You67]
    D. Younger. Recognition and parsing of context-free languages in time O(n 3). Information and Control, 10:189–208, 1967.CrossRefzbMATHGoogle Scholar

Copyright information

© Springer-Verlag London Limited 2012

Authors and Affiliations

  1. 1.Department of Computer ScienceState University of New York at Stony BrookNew YorkUSA

Personalised recommendations