The Traveling Salesman Problem: Algorithms & Optimization
Videos from BIRS Workshop
Jakub Tarnawski, Ecole Polytechnique Federale de Lausanne
Monday Sep 24, 2018 09:01 - 10:20
A constant-factor approximation algorithm for the Asymmetric Traveling Salesman Problem
Bill Cook, University of Waterloo
Monday Sep 24, 2018 10:48 - 11:53
Open problems on TSP computation
Kent Quanrud, Univ. Illinois at Urbana-Champaign
Monday Sep 24, 2018 15:33 - 16:03
Approximating metric TSP and approximating the Held-Karp LP
Viswanath Nagarajan, University of Michigan
Monday Sep 24, 2018 16:04 - 16:33
Stochastic k-TSP
Zachary Friggstad, University of Alberta
Monday Sep 24, 2018 17:09 - 17:39
Compact, provably-good LPs for orienteering and regret-bounded vehicle routing
Neil Olver, Vrije Universiteit Amsterdam
Tuesday Sep 25, 2018 09:02 - 09:34
Pipage rounding, pessimistic estimators and matrix concentration
Shayan Oveis Gharan, University of Washington
Tuesday Sep 25, 2018 09:34 - 10:44
Thin trees and the asymmetric traveling salesman, Part 1
Nima Anari, Stanford University
Tuesday Sep 25, 2018 11:06 - 11:58
Thin trees and the asymmetric traveling salesman, Part 2
Ramamoorthi Ravi, Carnegie Mellon University
Tuesday Sep 25, 2018 15:35 - 16:07
Shorter tours and longer detours
Alantha Newman, CNRS and Université Grenoble-Alpes
Tuesday Sep 25, 2018 16:08 - 16:31
Using large cycle covers to find small cycle covers in cubic graphs
Vincent Cohen-Addad, CNRS & Sorbonne Université
Tuesday Sep 25, 2018 17:15 - 17:36
On the effectiveness of k-opt for Euclidean TSP
Martin Naegele, ETH
Wednesday Sep 26, 2018 09:03 - 10:01
A 1.5-approximation for path TSP
Vera Traub, University of Bonn
Wednesday Sep 26, 2018 10:29 - 11:27
Beating the integrality ratio for s-t-tours in graphs
Jens Vygen, University of Bonn
Wednesday Sep 26, 2018 11:30 - 12:32
Integrality ratios for the s-t-path TSP
Hung Le, Oregon State University
Thursday Sep 27, 2018 09:03 - 09:36
PTASes for (subset) TSP in minor-free graphs
Andras Sebo, CNRS & INP Grenoble
Thursday Sep 27, 2018 10:30 - 11:40
The salesman, the postman and (delta-) matroids
Sam Gutekunst, Cornell University
Thursday Sep 27, 2018 15:34 - 16:01
Semidefinite programming relaxations of the Traveling Salesman Problem
Tobias Moemke, University of Bremen and Saarland University
Thursday Sep 27, 2018 16:02 - 16:27
Maximum Scatter TSP in Doubling Metrics
Kenjiro Takazawa, Hosei University
Thursday Sep 27, 2018 16:28 - 16:59
Excluded t-factors in bipartite graphs: A unified framework for nonbipartite matchings and restricted 2-matchings
Yuri Faenza, Columbia University
Thursday Sep 27, 2018 17:01 - 17:31
Bounded pitch inequalities for min knapsack: approximate separation and integrality gaps
Thomas Rothvoss, University of Washington
Friday Sep 28, 2018 09:05 - 09:38
A Tale of Santa Claus, Hypergraphs and Matroids
Tom McCormick, University of British Columbia
Friday Sep 28, 2018 09:39 - 10:05
Strongly Polynomial Algorithms for Some Problems Related to Parametric Global Minimum Cuts
