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

开始时间: 08/08/2020 持续时间: Unknown

所在平台: Coursera

课程类别: 计算机科学

大学或机构: CourseraNew

   

课程主页: https://www.coursera.org/learn/algorithms-npcomplete

Explore 1600+ online courses from top universities. Join Coursera today to learn data science, programming, business strategy, and more.

课程评论:没有评论

第一个写评论        关注课程

课程详情

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

再谈最短路径,NP完全问题及其处理方法:该专业部分的主要主题是:最短路径(Bellman-Ford,Floyd-Warshall,Johnson),NP完整性及其对算法的意义设计师,以及解决计算上棘手的问题的策略(启发式分析,本地搜索)。

课程评论(0条)

欢迎关注我们的公众号

NLPJob

课程简介

The primary topics in this part of the specialization are: shortest paths (Bellman-Ford, Floyd-Warsh

课程标签

NP完全问题 算法 斯坦福算法

0人关注该课程

主题相关的课程