Birs- 18w5088: The Traveling Salesman Problem: Algorithms & Optimization
-
Title: A constant-factor approximation algorithm for the Asymmetric Traveling Salesman Problem
Speaker:
Link:
-
Title: Open problems on TSP computation
Speaker:
Link:
-
Title: Approximating metric TSP and approximating the Held-Karp LP
Speaker:
Link:
-
Title: Stochastic k-TSP
Speaker:
Link:
-
Title: Compact, provably-good LPs for orienteering and regret-bounded vehicle routing
Speaker:
Link:
-
Title: Pipage rounding, pessimistic estimators and matrix concentration
Speaker:
Link:
-
Title: Thin trees and the asymmetric traveling salesman, Part 1
Speaker:
Link:
-
Title: Thin trees and the asymmetric traveling salesman, Part 2
Speaker:
Link:
-
Title: Shorter tours and longer detours
Speaker:
Link:
-
Title: Using large cycle covers to find small cycle covers in cubic graphs
Speaker:
Link:
-
Title: On the effectiveness of k-opt for Euclidean TSP
Speaker:
Link:
-
Title: A 1.5-approximation for path TSP
Speaker:
Link:
-
Title: Beating the integrality ratio for s-t-tours in graphs
Speaker:
Link:
-
Title: Integrality ratios for the s-t-path TSP
Speaker:
Link:
-
Title: PTASes for (subset) TSP in minor-free graphs
Speaker:
Link:
-
Title: The salesman, the postman and (delta-) matroids
Speaker:
Link:
-
Title: Semidefinite programming relaxations of the Traveling Salesman Problem
Speaker:
Link:
-
Title: Maximum Scatter TSP in Doubling Metrics
Speaker:
Link:
-
Title: Excluded t-factors in bipartite graphs: A unified framework for nonbipartite matchings and restricted 2-matchings
Speaker:
Link:
-
Title: Bounded pitch inequalities for min knapsack: approximate separation and integrality gaps
Speaker:
Link: