Matthias Mnich - Time- and Space-Optimal Algorithms for the Many-Visits TSP

Matthias Mnich - Time- and Space-Optimal Algorithms for the Many-Visits TSP

Hausdorff Center for Mathematics via YouTube Direct link

The algorithm by Cosmadakis & Papadimitriou, SICOMP 1984

6 of 14

6 of 14

The algorithm by Cosmadakis & Papadimitriou, SICOMP 1984

Class Central Classrooms beta

YouTube videos curated by Class Central.

Classroom Contents

Matthias Mnich - Time- and Space-Optimal Algorithms for the Many-Visits TSP

Automatically move to the next video in the Classroom when playback concludes

  1. 1 Intro
  2. 2 Single-machine scheduling with few job classes
  3. 3 A TSP formulation
  4. 4 Applications
  5. 5 Previous work
  6. 6 The algorithm by Cosmadakis & Papadimitriou, SICOMP 1984
  7. 7 Example
  8. 8 A first simple algorithm
  9. 9 Solution
  10. 10 Formulating the improved algorithm
  11. 11 The improved algorithm / 2
  12. 12 Complexity analysis
  13. 13 Final run time improvements / 1
  14. 14 Summary

Never Stop Learning.

Get personalized course recommendations, track subjects and courses with reminders, and more.

Someone learning on their laptop while sitting on the floor.