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
782 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:

1 - 25 of 104 Reviews for Shortest Paths Revisited, NP-Complete Problems and What To Do About Them

By Yusuke U

Dec 23, 2018

By Cindy T

May 31, 2018

By Jakub C

Jul 1, 2018

By Nelson L W

May 27, 2017

By Subodh C

Sep 25, 2017

By GongPing

Sep 7, 2017

By Aleksandar

Mar 5, 2019

By Besher A M

Dec 31, 2019

By Jemaal K

Feb 16, 2019

By Yixian H

Jan 2, 2020

By Jephte E

Dec 27, 2019

By Minsub L

Nov 13, 2019

By Pranjal V

Nov 23, 2017

By Rúben G

May 13, 2020

By Nikita T

Aug 8, 2021

By Yuxing C

Apr 10, 2020

By Christopher P

Aug 2, 2020

By Mikhail K

Apr 5, 2020

By Sergey T

Aug 2, 2020

By Richard P

Jan 7, 2018

By Sriram V

Sep 6, 2020

By Katrina C

Apr 17, 2020

By Xiaokang W

Jul 23, 2017

By jeremy j

Apr 3, 2020

By Toshikazu Y

Oct 31, 2019