Shortest Paths Revisited, NP-Complete Problems and What To Do About Them
list 4 sequences
assignment Level : Intermediate
chat_bubble_outline Language : English
card_giftcard 160 points
Users' reviews
-
starstarstarstarstar

Key information

credit_card Free access
verified_user Fee-based Certificate
timer 16 hours in total

About the content

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

more_horiz Read more
more_horiz Read less
dns

Syllabus

  • Week 1 - Week 1
    The Bellman-Ford algorithm; all-pairs shortest paths.
  • Week 2 - Week 2
    NP-complete problems and exact algorithms for them.
  • Week 3 - Week 3
    Approximation algorithms for NP-complete problems.
  • Week 4 - Week 4
    Local search algorithms for NP-complete problems; the wider world of algorithms.
record_voice_over

Instructors

Tim Roughgarden
Professor
Computer Science

store

Content designer

Stanford University
The Leland Stanford Junior University, commonly referred to as Stanford University or Stanford, is an American private research university located in Stanford, California on an 8,180-acre (3,310 ha) campus near Palo Alto, California, United States.
assistant

Platform

Coursera

Coursera is a digital company offering massive open online course founded by computer teachers Andrew Ng and Daphne Koller Stanford University, located in Mountain View, California. 

Coursera works with top universities and organizations to make some of their courses available online, and offers courses in many subjects, including: physics, engineering, humanities, medicine, biology, social sciences, mathematics, business, computer science, digital marketing, data science, and other subjects.

You are the designer of this MOOC?
What is your opinion on this resource ?
Content
0/5
Platform
0/5
Animation
0/5