Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Author information
Authors and Affiliations
Corresponding authors
Rights and permissions
About this article
Cite this article
Borodin, A., Nielsen, M. & Rackoff, C. (Incremental) Priority Algorithms. Algorithmica 37, 295–326 (2003). https://doi.org/10.1007/s00453-003-1036-3
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00453-003-1036-3