Shortest Paths Revisited, NP-Complete Problems and What To Do About Them

Completed by Anton Kulikov

January 15, 2020

13 hours (approximately)

View certificate for Anton Kulikov, Shortest Paths Revisited, NP-Complete Problems and What To Do About Them, an online non-credit course authorized by Stanford Online and offered through Coursera