A Constant-factor Approximation Algorithm for the Asymmetric Traveling Salesman Problem

Channel:
United States Simons Institute for the Theory of Computing
Subscribers:
68,700
Published on ● Video Link: https://www.youtube.com/watch?v=xeOSV7FaJwY


Duration: 1:07:59
2,069 views
27

László Végh, London School of Economics
https://simons.berkeley.edu/talks/laszlo-vegh-09-12-17
Discrete Optimization via Continuous Relaxation



Other Videos By Simons Institute for the Theory of Computing


2017-09-14Beyond Worst Case Analysis in Approximation
2017-09-13The Non-Uniform k-Center Problem
2017-09-13Online Optimization, Smoothing, and Competitive Ratio
2017-09-13A Nearly-linear Time Algorithm for Submodular Maximization with a Knapsack Constraint
2017-09-13Submodular Unsplittable Flow on Trees
2017-09-13Submodular Optimization
2017-09-12LP Rounding for Poise
2017-09-12Improved Approximation for Non-preemptive Scheduling via Time-indexed LP Relaxations
2017-09-12Surviving in Directed Graphs: A Quasi-polynomial-time Polylogarithmic Approximation...
2017-09-12Compact, Provably-good LPs for Orienteering and Regret-bounded Vehicle Routing
2017-09-12A Constant-factor Approximation Algorithm for the Asymmetric Traveling Salesman Problem
2017-09-12Improved Approximation Algorithms for the TSP and S-t-path TSP
2017-09-11A Strongly Polynomial Algorithm for Bimodular Integer Linear Programming
2017-09-11On Approximating the Covering Radius and Finding Dense Lattice Subspaces
2017-09-11Discrepancy and Approximation Algorithms
2017-09-11LPs and Convex Programming Relaxations and Rounding for Stochastic Problems
2017-09-11Simplex Transformations and Multiway Cut
2017-09-11The Power of Hierarchies for Detecting Hidden Structures
2017-08-25Interior Point Methods 4
2017-08-25Continuous Methods 4
2017-08-25Continuous Methods 3


Tags:
Simons Institute
Theory of Computing
Theory of Computation
Theoretical Computer Science
Computer Science
UC Berkeley
Discrete Optimization via Continuous Relaxation
László Végh