Logo

$79

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

Created by -

Tim Roughgarden
,
Stanford University

0.00

(0 ratings)

English

Wishlist

Overview

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).

course image

USD 79

provider image

Type: Online

This course includes

  • Approx. 14 hours to complete
  • Earn a Certificate upon completion
  • Start instantly and learn at your own schedule.

Taken this course?

Share your experience with other students

Share

Add Review

course image

USD 79

provider image

Type: Online

This course includes

  • Approx. 14 hours to complete
  • Earn a Certificate upon completion
  • Start instantly and learn at your own schedule.

Taken this course?

Share your experience with other students

Share

Add Review

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

Created by -

Tim Roughgarden
,
Stanford University

0.00

(0 ratings)

All Levels

Start Date: February 15th 2021

Course Description

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).

The information used on this page is how each course is described on the Coursera platform.

Course Structure

Tags

Mark Complete


About the Instructor

Tim Roughgarden,Stanford University

No Reviews at this moment.

Explore Skillqore

Skillqore Newsletter

Keep me up to date with content, updates, and offers from Skillqore


Copyright © 2020 Skillqore, Inc. All Rights Reserved.