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

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

By 李培春

Jun 24, 2017

By Samuel E

Mar 12, 2020

By Haixu L

Dec 24, 2020

By Thomas S

Jan 25, 2018

By Tsogtbayar N

Sep 10, 2017

By Anton B

Jan 18, 2019

By Sui X

Jun 11, 2019

By zhangdi

Dec 6, 2017

By Yu G

Feb 6, 2021

By Jianghua F

Jan 29, 2018

By Minyue D

Jul 13, 2017

By Ajit B

Sep 6, 2020

By biswa

Nov 10, 2018

By Dinghan X

Jun 5, 2020

By Madhurya m

Sep 3, 2019

By dynasty919

Mar 14, 2018

By Zhiping L

Jul 4, 2020

By Reda M M G

Feb 18, 2022

By Ahmad e D

Nov 12, 2020

By Sanket S

Jul 10, 2017

By Nikeshkin L E

Oct 1, 2020

By Oleksandr S

Jan 13, 2021

By PLN R

Jun 25, 2018

By Marko D

Mar 25, 2020

By Zihan H

May 3, 2018