Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming

Completed by Ivan Igorevich Kuznetsov

April 1, 2018

14 hours (approximately)

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