All Courses
Coursera
Course
Unknown
Shortest Paths Revisited, NP-Complete Problems and What To Do About Them
Stanford University
Review shortest path algorithms like Bellman-Ford and Floyd-Warshall, understand NP-completeness, and explore heuristic and local search strategies for hard problems.
Unknown4 weeksEnglish49,311 enrolled
About this Course
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).
What You'll Learn
- Understand classical shortest path algorithms
- Recognize NP-completeness concepts and challenges
- Apply strategies for hard computational problems
- Use heuristics and local search for approximate solutions
Prerequisites
- Basic familiarity with the topic and its common terminology
- Readiness to practice through applied exercises or case-based work
Instructors
T
Tim Roughgarden
Professor
Topics
Algorithms
Computer Science
Math and Logic
Data Structures
Theoretical Computer Science
Computational Thinking
Operations Research
Pseudocode
Graph Theory
Course Info
PlatformCoursera
LevelUnknown
PacingUnknown
PriceFree
Skills
الخوارزميات
علوم الحاسوب
الرياضيات والمنطق
هياكل البيانات
علوم الحاسوب النظرية
التفكير الحاسوبي
بحوث العمليات
البرمجة الزائفة
Graph Theory
إعلان
إعلان