The classification of greedy algorithms

Authors:
S. A. Curtis
Affiliations:
Department of Computing, Oxford Brookes University, Oxford OX33 1HX, UK
Venue:
Science of Computer Programming
Year:
2003

Citing 19
Cited 3

An O(n log2n) algorithm for the maximum weighted tardiness problem

Information Processing Letters
Introduction to algorithms

Introduction to algorithms
A simple program whose proof isn't

Beauty is our business
Longest segment problems

Science of Computer Programming
The smallest upravel

Science of Computer Programming
An exact characterization of greedy structures

SIAM Journal on Discrete Mathematics
Programming from specifications (2nd ed.)

Programming from specifications (2nd ed.)
Algebra of programming

Algebra of programming
Algorithmic Solution of the Change-Making Problem

Journal of the ACM (JACM)
Canonical Coin Changing and Greedy Solutions

Journal of the ACM (JACM)
Common phrases and minimum-space text storage

Communications of the ACM
Computer Algorithms: C++

Computer Algorithms: C++
A Method of Programming

A Method of Programming
From Dynamic Programming to Greedy Algorithms

Proceedings of the IFIP TC2/WG 2.1 State-of-the-Art Report on Formal Program Development
Mathematical Structures Underlying Greedy Algorithms

FCT '81 Proceedings of the 1981 International FCT-Conference on Fundamentals of Computation Theory
Greedy Algorithms for the Shortest Common Superstring that are Asmtotically Optimal

ESA '96 Proceedings of the Fourth Annual European Symposium on Algorithms
Approximating Polygons and Subdivisions with Minimum Link Paths

ISA '91 Proceedings of the 2nd International Symposium on Algorithms
Solving Optimisation Problems with Catamorphism

Proceedings of the Second International Conference on Mathematics of Program Construction
Practical Algorithms For Online Routing on SIMD Meshes

Practical Algorithms For Online Routing on SIMD Meshes

Incremental Parametric Development of Greedy Algorithms

Electronic Notes in Theoretical Computer Science (ENTCS)
Maximum segment sum is back: deriving algorithms for two segment problems with bounded lengths

PEPM '08 Proceedings of the 2008 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
A class of Greedy algorithms and its relation to greedoids

ICTAC'10 Proceedings of the 7th International colloquium conference on Theoretical aspects of computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.