filmov
tv
Jakub Tarnawski: Approximation Algorithms for the (Asymmetric) Traveling Salesman Problem
Показать описание
The famous Traveling Salesman Problem (TSP) asks: given a graph with weights on edges, what is the shortest tour that visits all vertices? As TSP is NP-hard, the theoretical study of algorithms for TSP has focused on approximation algorithms - ones that are provably both efficient and give solutions competitive with the optimum. In this talk I will give a short introduction to approximation algorithms for TSP. In particular, I will discuss the first constant-factor approximation algorithm for the asymmetric version of TSP (ATSP), where the graph is directed, which is a 2017 joint work with Ola Svensson and László Végh. This will serve as a nice example of how linear programming is a very useful technique in the design of algorithms for discrete problems.
0:54:08
Jakub Tarnawski: Approximation Algorithms for the (Asymmetric) Traveling Salesman Problem
0:05:11
How the ATSP Breakthrough was Made (ft. Ola Svensson & Jakub Tarnawski)
![[15.07.2020] Jakub Tarnawski](https://i.ytimg.com/vi/Wd4IbLvYVxg/hqdefault.jpg)
0:51:07
[15.07.2020] Jakub Tarnawski - Hierarchy-Based Algorithms for Minimizing Makespan under ...
0:06:39
The Travelling Salesman Problem (ft. Ola Svensson & Jakub Tarnawski)
0:27:03
STOC 2018 talk: Constant-Factor Approximation for Asymmetric Traveling Salesman Problem
0:06:54
Breakthrough in Asymmetric TSP (ft. Ola Svensson & Jakub Tarnawski)
0:47:51
A Constant-Factor Approximation Algorithm for the Asymmetric Traveling Salesman Problem
0:29:36
TSP: new solvable cases and linkages with the development of approximation algorithms
1:01:27
Improved Approximation Algorithms for the TSP and S-t-path TSP
0:52:51
22Jan28 Tutte Traveling Salesman Problems Approximation Algorithms and Black-Box Reductions
1:07:59
A Constant-factor Approximation Algorithm for the Asymmetric Traveling Salesman Problem
2:40:56
20171110 Approximation algorithm
0:45:46
A (Slightly) Improved Approximation Algorithm for Metric TSP
0:24:15
STOC 2021 - Near-Linear Time Approximation Schemes for Steiner Tree and Forest in Low-Dim Spaces
1:06:37
A Gap-ETH-Tight Approximation Scheme for Euclidean TSP
0:58:57
Nathan Klein: A (Slightly) Improved Approximation Algorithm for Metric TSP
1:12:03
Ola Svensson @ Theory Lunch
0:55:43
Approximation algorithms for Travelling Salesman Problem
1:03:04
László Végh: A constant-factor approximation algorithm for the asymmetric tsp (Part I)
0:15:37
#INFORMATIK2020: GI-Dissertationspreis für neuen Algorithmus zum 'Problem des Handlungsreisende...
0:53:58
A (slightly) improved approximation algorithm for metric TSP
0:49:50
Lecture 12: Approximation Algorithms
0:23:59
STOC 2023 - Session 10B - An improved approximation guarantee for Prize-Collecting TSP.
0:29:57
Thomas Rothvoß: Scheduling with Communication Delays via LP Hierarchies and Clustering
Комментарии