This is an old revision of the document!
Table of Contents
Chapter 4
definition of Greedy agorithm: An algorithm is greedy if it builds up a solution in sma!l steps, choosing a decision at each step myopically to optimize some underlying criterion. OR Finding the best step locally.
4.1 Interval Scheduling: The Greedy Algorithm Stays Ahead
Section Summary:
