Information Technology
Hands on Training icon
Hands On Training
Hands on Training icon

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

Course Cover

5

(4)

compare button icon
Course Report - Shortest Paths Revisited, NP-Complete Problems and What To Do About Them

Course Report

Find detailed report of this course which helps you make an informed decision on its relevance to your learning needs. Find out the course's popularity among Careervira users and the job roles that would find the course relevant for their upskilling here. You can also find how this course compares against similar courses and much more in the course report.

Course Features

icon

Duration

14 hours

icon

Delivery Method

Online

icon

Available on

Limited Access

icon

Accessibility

Mobile, Desktop, Laptop

icon

Language

English

icon

Subtitles

English

icon

Level

Intermediate

icon

Teaching Type

Self Paced

icon

Video Content

14 hours

Course Description

This section of the specialization focuses on the shortest paths (Bellman Ford, Floyd-Warshall and Johnson), NP-completeness (and what it means to the algorithm designer) and strategies for coping computationally difficult problems (analysis and heuristics and local search).

Course Overview

projects-img

Hands-On Training,Instructor-Moderated Discussions

projects-img

Case Studies, Captstone Projects

Skills You Will Gain

What You Will Learn

You will gain knowledge on Data Structure

You will gain knowledge on Algorithms

You will gain knowledge on Np-Completeness

You will gain knowledge on Dynamic Programming

Course Instructors

Tim Roughgarden

Computer Science

Tim Roughgarden is a Professor of Computer Science and (by courtesy) Management Science and Engineering at Stanford University. He received a BS in Applied Mathematics from Stanford in 1997, and a Ph...

Course Reviews

Average Rating Based on 4 reviews

4.8

100%

Course Cover