1 citations · 1 across the 1 of their papers we have counts for
1 paper
Salomon Bendayan, Joseph Cheriyan, Kevin K. H. Cheung
We show that the Unconstrained Traveling Tournament Problem (UTTP) is APX-complete by presenting an L-reduction from a version of metric (1,2)-TSP to UTTP. Keywords: Traveling Tour…