Recognizing Greedy Structures

Yair Caro*, András Sebo, Michael Tarsi

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review


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 languageEnglish
Pages (from-to)137-156
Number of pages20
JournalJournal of Algorithms
Issue number1
StatePublished - Jan 1996


Dive into the research topics of 'Recognizing Greedy Structures'. Together they form a unique fingerprint.

Cite this