| Article ID: | iaor20073001 |
| Country: | Netherlands |
| Volume: | 92 |
| Issue: | 1 |
| Start Page Number: | 53 |
| End Page Number: | 56 |
| Publication Date: | Oct 2004 |
| Journal: | Information Processing Letters |
| Authors: | Curtis S.A. |
| Keywords: | programming: travelling salesman |
Dartboard design can be seen as an instance of the travelling salesman problem with maximum costs. This paper presents a simple yet optimal greedy algorithm to arrange numbers on both circular dartboards and linear hoopla boards. As a result, it identifies a class of polynomially solvable travelling salesman problems.