开始时间: 04/22/2022 持续时间: Unknown
所在平台: CourseraArchive 课程类别: 计算机科学 大学或机构: CourseraNew |
课程主页: https://www.coursera.org/archive/algorithms-npcomplete
课程评论:没有评论
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).