Join NowName: Shortest Paths Revisited, NP-Complete Problems and What To Do About Them
Creator: Stanford University
Category: Software > Computer Software > Educational Software
Topic: Math and Logic
Tag: algorithm, analysis, designer, local, problems
Availability: In stock
Price: USD 79.00
Creator: Stanford University
Category: Software > Computer Software > Educational Software
Topic: Math and Logic
Tag: algorithm, analysis, designer, local, problems
Availability: In stock
Price: USD 79.00
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).
