Incremental) priority algorithms

We study the question of what optimization problems can be optimally or approximately solved by greedy-like algorithms. For definiteness, we will limit the present discussion to some well-studied scheduling problems although the underlying issues apply in a much more general setting. Of course, the ... View More