A (Slightly) Improved Approximation Algorithm for Metric TSP

Channel:

Subscribers:

68,700

Published on October 13, 2020 12:06:27 AM ● Video Link: https://www.youtube.com/watch?v=Er-Wdph2mLg

Duration: 45:46

1,336 views

Other Videos By Simons Institute for the Theory of Computing

2020-10-20	Sharp Isoperimetric Inequalities for Affine Quermassintegrals
2020-10-19	A Probabilistic Mechanism for Quark Confinement
2020-10-19	From Gaussian Measure to Partial Colorings and Linear Size Sparsifiers
2020-10-19	Projections of Probability Distributions: A Measure-Theoretic Dvoretzky Theorem
2020-10-19	Aspects of Coulomb Gases
2020-10-19	Tail and Moment Bounds for Gaussian Chaoses in Banach Spaces
2020-10-14	The Ethical Algorithm
2020-10-12	New Tools for Analysis of Markov Chains via High-Dimensional Expansion
2020-10-12	Lee-Yang Zeros and the Complexity of the Ferromagnetic Ising Model on Bounded-Degree Graphs
2020-10-12	Determinantal Representations and the Principal Minor Map
2020-10-12	A (Slightly) Improved Approximation Algorithm for Metric TSP
2020-10-12	Zero-Free Regions for Repulsive Gasses
2020-10-12	A Geometric Approach to Conic Stability of Polynomials
2020-10-12	Paving Property for Strongly Rayleigh Distributions
2020-10-12	Simplicial Generation of Chow Rings of Matroids
2020-10-12	Classical Algorithms, Correlation Decay, and Complex Zeros of Quantum Partition Functions
2020-10-12	Spectral Sets and Derivatives of The Psd Cone
2020-10-09	Robustly Learning Mixtures of (Clusterable) Gaussians via the SoS Proofs to Algorithms Method
2020-10-05	Richard M. Karp Distinguished Lecture – Safe Learning in Robotics
2020-10-02	Deep Robust Reinforcement Learning and Regularization
2020-10-02	Mixed Autonomy Traffic: A Reinforcement Learning Perspective

Tags:

Simons Institute

theoretical computer science

UC Berkeley

Computer Science

Theory of Computation

Theory of Computing