Recursive greedy methods

Guy Even*

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review


Greedy algorithms are often the first algorithms that one considers for various optimization problems, and, in particular, covering problems. The idea is very simple: try to build a solution incrementally by augmenting a partial solution. In each iteration, select the “best” augmentation according to a simple criterion. The term greedy is used because the most common criterion is to select an augmentation that minimizes the ratio of “cost” to “advantage.” We refer to the cost-to-advantage ratio of an augmentation as the density of the augmentation.

Original languageEnglish
Title of host publicationHandbook of Approximation Algorithms and Metaheuristics
PublisherCRC Press
ISBN (Electronic)9781420010749
ISBN (Print)1584885505, 9781584885504
StatePublished - 1 Jan 2007


Dive into the research topics of 'Recursive greedy methods'. Together they form a unique fingerprint.

Cite this