Skip to main content
You are currently using guest access (
Log in
)
Module 4. NP-hard problems
Home
Courses
Весенний семестр
Фундаментальная информатика и ИТ
ADS
Module 4. NP-hard problems
Section outline
◄
Module 3. Dynamic progamming
Select activity Lecture 13. NP-hard problems (concept). Travelling Salesman Problem
Lecture 13. NP-hard problems (concept). Travelling Salesman Problem
File
Select activity Assignment 6. Brute-force algorithm for TSP
Assignment 6. Brute-force algorithm for TSP
Select activity Test data for assignment 6
Test data for assignment 6
File
Select activity Lecture 14. Inexact algorithms
Lecture 14. Inexact algorithms
File
Select activity Test 4 (online)
Test 4 (online)
Quiz
Select activity Test 4
Test 4
Assignment
◄
Module 3. Dynamic progamming
Jump to...
Main course page
General
Module 1. Introduction to algorithms and data structures
Module 2.Greedy algorithms. Divide-and-Conquer strategy.
Module 3. Dynamic progamming
Module 4. NP-hard problems