The classification of greedy algorithms

Abstract

This paper presents principles for the classi$cation 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. c © 2003 Elsevier B.V. All rights reserved. 
DOI: 10.1016/j.scico.2003.09.001

Topics

  • Presentations referencing similar topics