YoVDO

Reducing Path TSP to TSP

Offered By: Association for Computing Machinery (ACM) via YouTube

Tags

Travelling Salesman Problem (TSP) Courses Computer Science Courses Optimization Algorithms Courses Traveling Salesman Problem Courses

Course Description

Overview

Explore the reduction of Path TSP to TSP in this 25-minute ACM conference talk. Delve into the background of the canonical idea, examine large distance scenarios, and analyze special cases through examples. Gain insights into this important topic in computational complexity theory and optimization algorithms, concluding with a comprehensive understanding of the reduction process and its implications.

Syllabus

Introduction
Background
canonical idea
large distance
special cases
example
conclusion


Taught by

Association for Computing Machinery (ACM)

Related Courses

Probabilistic Graphical Models 1: Representation
Stanford University via Coursera Computer Security
Stanford University via Coursera Intro to Computer Science
University of Virginia via Udacity Introduction to Logic
Stanford University via Coursera Internet History, Technology, and Security
University of Michigan via Coursera