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

Completed by Gert de Pagter

April 3, 2019

4 weeks of study, 4-8 hours/week

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