1 citations · 1 across the 3 of their papers we have counts for
1 paper · 1 filter
René van Bevern, Daniel A. Skachkov
The NP-hard graphical traveling salesman problem (GTSP) is to find a closed walk of total minimum weight that visits each vertex in an undirected edge-weighted and not necessarily…