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

Completed by Pascal Prinz

June 15, 2023

13 hours (approximately)

View certificate for Pascal Prinz, 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