next up previous contents
Next: Huffman Coding: Introduction Up: 3240 Previous: Longest Path: Introduction   Contents

Greedy Algorithms [208]

Make a decision that looks good without concern for the future.

``Take what you can get now.''

A local optimum is chosen.

Sometimes the result yields a global optimum.

Example: Shortest Path, Mimimum Spanning Tree

Other times the result yields an approximation.



Subsections

Ted Billard 2001-10-25