An Explicit Lower Bound for TSP with Distances One and Two

Lars Engebretsen. An Explicit Lower Bound for TSP with Distances One and Two. Algorithmica, 35(4):301-318, 2003. [doi]

Authors

Lars Engebretsen

This author has not been identified. Look up 'Lars Engebretsen' in Google