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

Completed by Sarthak Kathait

May 9, 2025

13 hours (approximately)

View certificate for Sarthak Kathait, 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