From dynamic programming to greedy algorithms-Reference-Cited by-同舟云学术

From dynamic programming to greedy algorithms

Published:1993 Issue: Volume: Page:43-61
ISSN:0302-9743
Container-title:Formal Program Development
language:
Short-container-title:

Author:

Bird Richard,Moor Oege

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-57499-9_16.pdf

Reference17 articles.

1. 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.

2. M. Barr and C. Wells. Category Theory for Computing Science. Prentice-Hall, 1990.

3. R.S. Bird and O. de Moor. List partitions. To appear, Formal Aspects of Computing, 1992.

4. 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.

5. E.W. Dijkstra. A Discipline of Programming. Prentice-Hall, 1976.

Cited by 7 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Theory and Techniques for Synthesizing Efficient Breadth-First Search Algorithms;FM 2012: Formal Methods;2012

2. A Class of Greedy Algorithms and Its Relation to Greedoids;Lecture Notes in Computer Science;2010

3. Toward an Automatic Approach to Greedy Algorithms;Frontiers in Algorithmics;2009

4. Dynamic Programming via Static Incrementalization;Automatic Program Development;2008

5. The classification of greedy algorithms;Science of Computer Programming;2003-12