Lars Engebretsen. An Explicit Lower Bound for TSP with Distances One and Two. Electronic Colloquium on Computational Complexity (ECCC), 5(46), 1998. [doi]
@article{ECCC-TR98-046,
title = {An Explicit Lower Bound for TSP with Distances One and Two},
author = {Lars Engebretsen},
year = {1998},
url = {http://eccc.hpi-web.de/eccc-reports/1998/TR98-046/index.html},
researchr = {https://researchr.org/publication/ECCC-TR98-046},
cites = {0},
citedby = {0},
journal = {Electronic Colloquium on Computational Complexity (ECCC)},
volume = {5},
number = {46},
}