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

Delivery Problem
University of California, San Diego via Coursera Dynamic Programming
YouTube What Is the Best Way to Lace Your Shoes? Dream Proof
Mathologer via YouTube The Traveling Salesman Problem - When Good Enough Beats Perfect
Reducible via YouTube Asymmetric Traveling Salesman Problem: Advances and Challenges - Session 1A
Association for Computing Machinery (ACM) via YouTube