In: Bernhard Moeller, Helmut Partsch, and Steve Schumann, Formal Program Development. Lecture Notes in Computer Science 755, pp. 43-61, 1993.

Authors: Richard S. Bird and Oege de Moor
>

Abstract

Traditionally the two paradigms of greedy algorithms and dynamic programming are formalised in completely different ways. In this paper, we demonstrate how the two are intimately related, and how one can view greedy algorithms as a refinement of dynamic programming solutions to the same problem.

(PS)

BIBTEX:

           @inproceedings{fpd93bird, 
           author = "Richard S. Bird and De Moor, Oege", 
           title = "From dynamic programming to greedy algorithms", 
           booktitle = "Formal program development", 
           editor = "B. Moeller and H. Partsch and S. Schumann", 
           year = "1993",
           series = "Lecture Notes in Computer Science",
           volume = "755",
           pages = "43-61",
           year = "1993"}