Chevron Left
Back to Shortest Paths Revisited, NP-Complete Problems and What To Do About Them

Learner Reviews & Feedback for Shortest Paths Revisited, NP-Complete Problems and What To Do About Them by Stanford University

4.8
stars
766 ratings

About the Course

The primary topics in this part of the specialization are: shortest paths (Bellman-Ford, Floyd-Warshall, Johnson), NP-completeness and what it means for the algorithm designer, and strategies for coping with computationally intractable problems (analysis of heuristics, local search)....

Top reviews

AA

Feb 27, 2017

This challenging course improves understanding of algorithms and is intellectually stimulating. I learnt the theory behind algorithms and how they are applied to solve real world problems.

AS

Aug 22, 2018

This is the most challenging course in this specialization. Assignments as well as test questions require good amount of thinking.

One of the best courses I did on Coursera.

Filter by:

26 - 50 of 103 Reviews for Shortest Paths Revisited, NP-Complete Problems and What To Do About Them

By Ryan J S

Jun 9, 2020

By Richard H

Aug 13, 2017

By John W

Nov 19, 2017

By Ravishankar J

Aug 14, 2017

By Abhit

Feb 28, 2017

By Charles H

Feb 19, 2019

By Ashish S

Aug 23, 2018

By Dustin Z

Feb 16, 2021

By tao L

Mar 5, 2018

By Kaan A

Dec 14, 2019

By Johnathan F

Jan 14, 2018

By Himanshu P

May 6, 2020

By Steven W

Aug 10, 2020

By Jonathan M

May 26, 2020

By Luiz C

May 2, 2018

By Yosef A

Feb 26, 2021

By Shubham A

Mar 16, 2020

By Nicolae S A

Feb 25, 2019

By Yuxiao W

Mar 4, 2018

By Masashi K

Nov 2, 2020

By Michael j

Nov 30, 2019

By Brande G

Jul 7, 2018

By Prince C S

Sep 9, 2021

By Yiming Z

Aug 13, 2018

By Ankit B

Apr 29, 2017