  In this paper, we give a simple polynomial-time reduction of {L(p)-Labeling}
on graphs with a small diameter to {Metric (Path) TSP}, which enables us to use
numerous results on {(Metric) TSP}. On the practical side, we can utilize
various high-performance heuristics for TSP, such as Concordo and LKH, to solve
our problem. On the theoretical side, we can see that the problem for any p
under this framework is 1.5-approximable, and it can be solved by the Held-Karp
algorithm in O(2^n n^2) time, where n is the number of vertices, and so on.
