Abstract
We study decision problems of the following form: Given an instance of a combinatorial problem, can it be solved by a greedy algorithm? We present algorithms for the recognition of greedy instances of certain problems, structural characterization of such instances for other problems, and proofs of NP-hardness of the recognition problem for some other cases. Previous results of this type are also stated and reviewed.
| Original language | English |
|---|---|
| Pages (from-to) | 137-156 |
| Number of pages | 20 |
| Journal | Journal of Algorithms |
| Volume | 20 |
| Issue number | 1 |
| DOIs | |
| State | Published - Jan 1996 |