An Explicit Lower Bound for TSP with Distances One and Two

Lars Engebretsen. An Explicit Lower Bound for TSP with Distances One and Two. In Christoph Meinel, Sophie Tison, editors, STACS 99, 16th Annual Symposium on Theoretical Aspects of Computer Science, Trier, Germany, March 4-6, 1999, Proceedings. Volume 1563 of Lecture Notes in Computer Science, pages 373-382, Springer, 1999. [doi]

Abstract

Abstract is missing.