The classification of greedy algorithms

This paper presents principles for the classification of greedy algorithms for optimization problems. These principles are made precise by their expression in the relational calculus, and illustrated by various examples. A discussion compares this work to other greedy algorithms theory.

[1]  Carroll Morgan,et al.  Programming from specifications (2nd ed.) , 1994 .

[2]  Erik Poll,et al.  Algebra of Programming by Richard Bird and Oege de Moor, Prentice Hall, 1996 (dated 1997). , 1999 .

[3]  László Lovász,et al.  Mathematical Structures Underlying Greedy Algorithms , 1981, International Symposium on Fundamentals of Computation Theory.

[4]  Martin C. Herbordt,et al.  Practical Algorithms For Online Routing on SIMD Meshes , 1991 .

[5]  Eugene S. Schwartz,et al.  An Optimum Encoding with Minimum Longest Code and Total Number of Digits , 1964, Inf. Control..

[6]  B. Korte,et al.  Greedoids and Linear Objective Functions , 1984 .

[7]  Alan M. Frieze,et al.  Greedy Algorithms for the Shortest Common Superstring That Are Asymptotically Optimal , 1998, Algorithmica.

[8]  Robert A. Wagner,et al.  Common phrases and minimum-space text storage , 1973, CACM.

[9]  R. Prim.  Shortest connection networks and some generalizations , 1957 .

[10]  H. Whitney.  On the Abstract Properties of Linear Dependence , 1935 .

[11]  R. K. Shyamasundar,et al.  Introduction to algorithms , 1996 .

[12]  Richard S. Bird,et al.  From Dynamic Programming to Greedy Algorithms , 1993, Formal Program Development.

[13]  Carroll Morgan,et al.  Programming from specifications , 1990, Prentice Hall International Series in computer science.

[14]  Richard S. Bird,et al.  Algebra of programming , 1997, Prentice Hall International series in computer science.

[15]  Lena Chang,et al.  Canonical Coin Changing and Greedy Solutions , 1976, JACM.

[16]  Edsger W. Dijkstra,et al.  A method of programming , 1988 .

[17]  Leonidas J. Guibas,et al.  Approximating Polygons and Subdivisions with Minimum Link Paths , 1991, ISA.

[18]  Alan M. Frieze,et al.  Greedy Algorithms for the Shortest Common Superstring that are Asmtotically Optimal , 1996, ESA.

[19]  Henry D. Shapiro,et al.  An Exact Characterization of Greedy Structures , 1993, IPCO.

[20]  Jack Edmonds,et al.  Matroids and the greedy algorithm , 1971, Math. Program..

[21]  Richard S. Bird,et al.  Solving Optimisation Problems with Catamorphism , 1992, MPC.

[22]  Ron Shamir,et al.  An O(n log2 n) Algorithm for the Maximum Weighted Tardiness Problem , 1989, Inf. Process. Lett..

[23]  Richard S. Bird.  The Smallest Upravel , 1992, Sci. Comput. Program..

[24]  Eugene W. Myers,et al.  Combinatorial algorithms for DNA sequence assembly , 1995, Algorithmica.

[25]  Lambert Meertens,et al.  Algorithmics : towards programming as a mathematical activity , 1986 .

[26]  Bruno Charlier,et al.  The Greedy Algorithms Class: Formalization, Synthesis and Generalization , 1995 .

[27]  David A. Huffman,et al.  A method for the construction of minimum-redundancy codes , 1952, Proceedings of the IRE.

[28]  Sharon A. Curtis,et al.  A Relational Approach To Optimization Problems , 1996 .

[29]  Eugene L. Lawler,et al.  Optimal Sequencing of a Single Machine Subject to Precedence Constraints , 1973 .

[30]  J. Kruskal.  On the shortest spanning subtree of a graph and the traveling salesman problem , 1956 .

[31]  S. K. Chang,et al.  Algorithmic Solution of the Change-Making Problem , 1970, JACM.

[32]  David S. L. Wei,et al.  Computer Algorithms , 1998, Scalable Comput. Pract. Exp..

[33]  Sulamita Klein,et al.  List Partitions , 2003, SIAM J. Discret. Math..

[34]  Hans Zantema,et al.  Longest Segment Problems , 1992, Sci. Comput. Program..

[35]  Donald E. Knuth,et al.  A simple program whose proof isn't , 1990 .