“Classic” Examples of Greedy Algorithms

Minimum spanning tree MST Single source shortest path SSSP eg Dijkstras algorithm We will explore the main properties with focus on theoretical foundations MST Graph GVE undirected connected weighted arbitrary real weights w on edges

Embed this Presentation

Download Notice

Download Presentation The PPT/PDF document "“Classic” Examples of Greedy Algorit..." is the property of its rightful owner. Permission is granted to download and print the materials on this website for personal, non-commercial use only, and to display it on your personal computer provided you do not modify the materials and that you retain all copyright notices contained in the materials. By downloading content from our website, you accept the terms of this agreement.