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/02/21 01:37] – 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]] | |
| - | *[[Chapter Four|SectionI|]] | + | * [[ChapterFour |
| - | *[[Chapter Four| Section II]] | + | * [[ChapterFour SectionII|4.2. Scheduling to Minimize Lateness: An Exchange Argument]] |
| - | *[[Chapter Four| Section III]] | + | * [[ChapterFour SectionIII|4.3. Optimal Caching: A More Complex Exchange Argument]] |
| - | *[[Chapter Four| Section IV]] | + | * [[ChapterFour SectionIV|4.4. Shortest paths in a graph ]] |
| + | * [[ChapterFour SectionV|4.5. The Minimum Spanning Tree Problem]] | ||
| + | * [[ChapterFour SectionVI|4.6. Implementing Kruskal' | ||
| + | * [[ChapterFour SectionVII|4.7. Clustering]] | ||
| + | * [[ChapterFour SectionVIII|4.8 Huffman Codes and Data Compression]] | ||
