Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming

Completed by Alexander Alexandrovich Prokhorov

September 9, 2017

14 hours (approximately)

View certificate for Alexander Alexandrovich Prokhorov, Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming, an online non-credit course authorized by Stanford University and offered through Coursera