Abstract
In 1957 Fred Supnick investigated and solved a special case of the Travelling Salesman Problem. Since then, Supnick's results have been rediscovered many times by other researchers. This article discusses Supnick's results and some of the rediscoveries.
Original language | English |
---|---|
Pages (from-to) | 43-52 |
Journal | Bulletin of the European Association for Theoretical Computer Science, EATCS |
Volume | 90 |
Publication status | Published - 2006 |