2 citations · 3 across the 5 of their papers we have counts for
1 paper · 2 filters
Sylvia Boyd, René Sitters, Suzanne van der Ster +1
We study the Travelling Salesman Problem (TSP) on the metric completion of cubic and subcubic graphs, which is known to be NP-hard. The problem is of interest because of its relati…