Differences
This shows you the differences between two versions of the page.
| Both sides previous revisionPrevious revisionNext revision | Previous revision | ||
| courses:cs211:winter2012:journals:jeanpaul:chapter_four [2012/03/01 01:57] – mugabej | courses:cs211:winter2012:journals:jeanpaul:chapter_four [2012/03/06 03:40] (current) – mugabej | ||
|---|---|---|---|
| Line 1: | Line 1: | ||
| ====== Chapter Four: Greedy Algorithms ====== | ====== Chapter Four: Greedy Algorithms ====== | ||
| + | * [[ChapterFour Section0|4.0 Greedy Algorithms]] | ||
| * [[ChapterFour SectionI|4.1. Interval Scheduling: The Greedy Algorithm Stays Ahead]] | * [[ChapterFour SectionI|4.1. Interval Scheduling: The Greedy Algorithm Stays Ahead]] | ||
| * [[ChapterFour SectionII|4.2. Scheduling to Minimize Lateness: An Exchange Argument]] | * [[ChapterFour SectionII|4.2. Scheduling to Minimize Lateness: An Exchange Argument]] | ||
| Line 6: | Line 6: | ||
| * [[ChapterFour SectionIV|4.4. Shortest paths in a graph ]] | * [[ChapterFour SectionIV|4.4. Shortest paths in a graph ]] | ||
| * [[ChapterFour SectionV|4.5. The Minimum Spanning Tree Problem]] | * [[ChapterFour SectionV|4.5. The Minimum Spanning Tree Problem]] | ||
| - | * [[ChapterFour | + | * [[ChapterFour |
| + | * [[ChapterFour SectionVII|4.7. Clustering]] | ||
| + | * [[ChapterFour SectionVIII|4.8 Huffman Codes and Data Compression]] | ||
