, Volume 37, Issue 4, pp 295–326 | Cite as

(Incremental) Priority Algorithms

  • Allan Borodin
  • Morten N. Nielsen
  • Charles Rackoff


We study the question of which optimization problems can be optimally or approximately solved by “greedy” or “greedy-like” algorithms. For definiteness, we limit the present discussion to some well-studied scheduling problems although the underlying issues apply in a much more general setting. Of course, the main benefit of greedy algorithms lies in both their conceptual simplicity and their computational efficiency. Based on the experience from online competitive analysis, it seems plausible that we should be able to derive approximation bounds for “greedy-like” algorithms exploiting only the conceptual simplicity of these algorithms. To this end, we need (and will provide) a precise definition of what we mean by greedy and greedy-like.

Priority algorithms Greedy algorithms Scheduling 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag 2003

Authors and Affiliations

  1. 1.Department of Computer Science, University of Toronto, Toronto, OntarioCanada M5S 3G4
  2. 2.Department of Mathematics and Computer Science, University of Southern Denmark, Campusvej 5S, DK-5230 Odense MDenmark

Personalised recommendations