verified
Verified Information • Last Updated Mar 2026
Shortest Paths Revisited, NP-Complete Problems and What To Do About Them
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).
Duration
6 Months
Institution
Stanford University
Format
Online
Eligibility Criteria
school
Academic Foundation
A recognized Bachelor’s degree or high school equivalent required for admission into Stanford University.
language
Language Proficiency
English proficiency required. IELTS, TOEFL, or standard medium-of-instruction certificates accepted.
Detailed Fees Breakdown
Base Tuition Fee
$95
Total Est. Investment
$95
Scholarships and early-bird waivers may apply. Contact admissions for exact institutional fees.
Academic Trajectory
Program Outcome
Graduates of the Shortest Paths Revisited, NP-Complete Problems and What To Do About Them program at Stanford University are equipped with global perspectives, ready to excel in international markets and top-tier career opportunities.