Birs- 18w5088: The Traveling Salesman Problem: Algorithms & Optimization

  1. Title:
    A constant-factor approximation algorithm for the Asymmetric Traveling Salesman Problem

    Speaker:

    Link:

  2. Title:
    Open problems on TSP computation

    Speaker:

    Link:

  3. Title:
    Approximating metric TSP and approximating the Held-Karp LP

    Speaker:

    Link:

  4. Title:
    Stochastic k-TSP

    Speaker:

    Link:

  5. Title:
    Compact, provably-good LPs for orienteering and regret-bounded vehicle routing

    Speaker:

    Link:

  6. Title:
    Pipage rounding, pessimistic estimators and matrix concentration

    Speaker:

    Link:

  7. Title:
    Thin trees and the asymmetric traveling salesman, Part 1

    Speaker:

    Link:

  8. Title:
    Thin trees and the asymmetric traveling salesman, Part 2

    Speaker:

    Link:

  9. Title:
    Shorter tours and longer detours

    Speaker:

    Link:

  10. Title:
    Using large cycle covers to find small cycle covers in cubic graphs

    Speaker:

    Link:

  11. Title:
    On the effectiveness of k-opt for Euclidean TSP

    Speaker:

    Link:

  12. Title:
    A 1.5-approximation for path TSP

    Speaker:

    Link:

  13. Title:
    Beating the integrality ratio for s-t-tours in graphs

    Speaker:

    Link:

  14. Title:
    Integrality ratios for the s-t-path TSP

    Speaker:

    Link:

  15. Title:
    PTASes for (subset) TSP in minor-free graphs

    Speaker:

    Link:

  16. Title:
    The salesman, the postman and (delta-) matroids

    Speaker:

    Link:

  17. Title:
    Semidefinite programming relaxations of the Traveling Salesman Problem

    Speaker:

    Link:

  18. Title:
    Maximum Scatter TSP in Doubling Metrics

    Speaker:

    Link:

  19. Title:
    Excluded t-factors in bipartite graphs: A unified framework for nonbipartite matchings and restricted 2-matchings

    Speaker:

    Link:

  20. Title:
    Bounded pitch inequalities for min knapsack: approximate separation and integrality gaps

    Speaker:

    Link: