'Light edge crossing' presentation slideshows

Greedy Algorithms

1.21k views • 57 slides

Lecture 18: Minimum Spanning Trees

Lecture 18: Minimum Spanning Trees. Shang-Hua Teng. Weighted Undirected Graphs. 2100. Positive weight on edges for distance. BOS. 200. v. 4. ORD. 1500. JFK. v. v. 2. 6. SFO. 1100. 1400. 900. DFW. LAX. v. 3. v. 1. MIA. v. 5. Weighted Spanning Trees.

497 views • 35 slides

MST

445 views • 31 slides

MST

379 views • 31 slides

Greedy Algorithms

Greedy Algorithms. Overview. Like dynamic programming, used to solve optimization problems. Problems exhibit optimal substructure (like DP). Problems also exhibit the greedy-choice property. When we have a choice to make, make the one that looks best right now .

534 views • 28 slides