Studyportals
Certificate Online

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

Highlights
Tuition fee
Free
Free
Free
Unknown
Tuition fee
Free
Free
Free
Unknown
Duration
7 days
Duration
7 days
Apply date
Anytime
Unknown
Apply date
Anytime
Unknown
Start date
Anytime
Unknown
Start date
Anytime
Unknown
Taught in
English
Taught in
English

About

The Shortest Paths Revisited, NP-Complete Problems and What To Do About Them course offered by Coursera in partnership with Stanford is part of the Algorithms Specialization.

Overview

The primary topics in this part of the Shortest Paths Revisited, NP-Complete Problems and What To Do About Them course offered by Coursera in partnership with Stanford 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).

Skills You Will Gain

  • Algorithms
  • Graph Theory
  • Problem Solving
  • Theoretical Computer Science
  • Computer Programming
  • Mathematics
  • Mathematical Theory & Analysis
  • Data Structures

Programme Structure

Courses included:

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

Key information

Duration

  • Part-time
    • 7 days
    • 10 hrs/week

Start dates & application deadlines

You can apply for and start this programme anytime.

Language

English

Delivered

Online

Campus Location

  • Mountain View, United States

What students do after studying

Join for free or log in to access our complete career info list.

Academic requirements

We are not aware of any specific GRE, GMAT or GPA grading score requirements for this programme.

English requirements

We are not aware of any English requirements for this programme.

Other requirements

General requirements

  • Intermediate Level
  • Some related experience required

Tuition Fees

Tuition fees are shown in and the most likely applicable fee is shown based on your nationality.
  • International

    Non-residents
    Free
  • Out-of-State
    Free
  • Domestic

    In-State
    Free

Funding

Coursera provides financial aid to learners who cannot afford the fee. Apply for it by clicking on the Financial Aid link beneath the "Enroll" button on the left. You'll be prompted to complete an application and will be notified if you are approved. You'll need to complete this step for each course in the Specialization, including the Capstone Project.

Other interesting programmes for you

Our partners

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

Wishlist

Go to your profile page to get personalised recommendations!