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

Deep Learning for Natural Language Processing
University of Oxford via Independent Improving Deep Neural Networks: Hyperparameter Tuning, Regularization and Optimization
DeepLearning.AI via Coursera Deep Learning Part 1 (IITM)
Indian Institute of Technology Madras via Swayam Deep Learning - Part 1
Indian Institute of Technology, Ropar via Swayam Logistic Regression with Python and Numpy
Coursera Project Network via Coursera