Abstract
A calculus of relations is used to reason about specifications and algorithms for optimisation problems. It is shown how certain greedy algorithms can be seen as refinements of dynamic programming. Throughout, the maximum lateness problem is used as a motivating example.
Research supported by a studentship from British Petroleum International.
Chapter PDF
Similar content being viewed by others
Keywords
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.
References
R.C. Backhouse, P. Hoogendijk, E. Voermans, and J.C.S.P. van der Woude. A relational theory of datatypes. Department of Mathematics and Computing Science, Eindhoven University of Technology, P.O. Box 513, 5600 MB Eindhoven, The Netherlands., June 1992.
M. Barr and C. Wells. Category Theory for Computing Science. Prentice-Hall, 1990.
R.S. Bird and O. de Moor. List partitions. To appear, Formal Aspects of Computing, 1992.
A. Carboni, G.M. Kelly, and R.J. Wood. A 2-categorical approach to geometric morphisms, i. Cahiers de Topologie et Geometrie Differentielle Categoriques, 32(1):47–95, 1991.
E.W. Dijkstra. A Discipline of Programming. Prentice-Hall, 1976.
Maarten M. Fokkinga. Law and Order in Algorithmes. PhD thesis, Technical University Twente, The Netherlands, 1992.
D.S. Hochbaum and R. Shamir. An O(n log2 n) algorithm for the maximum weighted tardiness problem. Information Processing Letters, 31:215–219, 1989.
B. Korte, L. Lovasz, and R. Schrader. Greedoids, volume 4 of Algorithms and combinatorics. Springer-Verlag, 1991.
J. Lambek. A fixpoint theorem for complete categories. Mathematische Zeitschrift, 103:151–161, 1968.
E.L. Lawler. Optimal sequencing of a single machine subject to precedence constraints. Management Science, 19(5):544–546, January 1973.
G. Malcolm. Homomorphisms and promotability. In J.L.A. van de Snepscheut, editor, Mathematics of Program Construction, volume 375 of Lecture Notes in Computer Science, pages 335–347. Springer-Verlag, 1989.
G. Malcolm. Data structures and program transformation. Science of Computer Programming, 14:255–279, 1990.
E.G. Manes and M.A. Arbib. Algebraic Approaches to Program Semantics. Texts and Monographs in Computer Science. Springer-Verlag, 1986.
L. Meertens. Paramorphisms. To appear, Formal Aspects of Computing, 1990.
O. de Moor. Categories, relations and dynamic programming. D.Phil. thesis. Technical Monograph PRG-98, Computing Laboratory, Oxford, 1992.
D.R. Smith. Applications of a strategy for designing divide-and-conquer algorithms. Science of Computer Programming, 18:213–229, 1987.
M. Spivey. A categorical approach to the theory of lists. In J.L.A. van de Snepscheut, editor, Mathematics of Program Construction, volume 375 of Lecture Notes in Computer Science, pages 399–408. Springer-Verlag, 1989.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Bird, R., de Moor, O. (1993). From dynamic programming to greedy algorithms. In: Möller, B., Partsch, H., Schuman, S. (eds) Formal Program Development. Lecture Notes in Computer Science, vol 755. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57499-9_16
Download citation
DOI: https://doi.org/10.1007/3-540-57499-9_16
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57499-6
Online ISBN: 978-3-540-48197-3
eBook Packages: Springer Book Archive