Coursera
Stanford University
Shortest Paths Revisited, NP-Complete Problems and What To Do About Them (Coursera)
Dive into advanced algorithmic concepts with 'Shortest Paths Revisited, NP-Complete Problems and What To Do About Them'. This course unravels the intricacies of shortest path algorithms, delves into the realm of NP-completeness, and equips you with strategies to tackle computationally hard problems effectively.