An Explicit Lower Bound for TSP with Distances One and Two

Lars Engebretsen. An Explicit Lower Bound for TSP with Distances One and Two. Electronic Colloquium on Computational Complexity (ECCC), 5(46), 1998. [doi]

Abstract

Abstract is missing.