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

Add to Favourites
1 1 1 1 1
Price: 3788 EUR 3788 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 class is offered as CS6290 at Georgia Tech wh ...
Computer Science is a rapidly evolving and increas ...
Cloud computing systems today, whether open-source ...
This course can also be taken for academic credit ...

 

©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