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

Add to Favourites
1 1 1 1 1
Price: 9930 EUR 9930 EUR
Contact Stanford University

More details about the program

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

Specific details

Category of Education Computer Sciense and IT

University

Stanford University

Comments (0)

There are no comments posted here yet

Leave your comments

Search

Related Programs

This course will introduce the learner to text min ...
Welcome to this course on Probabilistic Deep Learn ...
We all learn numbers from the childhood. Some of u ...
This course will help you build a foundation of so ...

 

©2023 EDUCOM NET. All Rights Reserved.

If you find an inaccuracy or you have comments on the description of the university or program - please let us know info@educom.net