Solving Distance-constrained Labeling Problems for Small Diameter Graphs via TSP
-
Published:2024
Issue:1
Volume:14
Page:26-39
-
ISSN:2185-2839
-
Container-title:International Journal of Networking and Computing
-
language:en
-
Short-container-title:IJNC
Author:
Hanaka Tesshu1,
Ono Hirotaka2,
Sugiyama Kosuke2
Affiliation:
1. Kyushu University
2. Nagoya University
Publisher
IJNC Editorial Committee
Reference36 articles.
1. [1] Concorde TSP solver. http://www.math.uwaterloo.ca/tsp/concorde.html. Accessed: 2023-02-11.
2. [2] LKH. http://webhotel4.ruc.dk/ keld/research/LKH/. Accessed: 2023-02-11.
3. [3] David Applegate, William Cook, and André Rohe. Chained lin-kernighan for large traveling salesman problems. INFORMS Journal on Computing, 15(1):82–92, 2003.
4. [4] Richard Bellman. Dynamic programming treatment of the travelling salesman problem. J. ACM, 9(1):61^^e2^^80^^9363, jan 1962.
5. [5] Alan A Bertossi and Cristina M Pinotti. Approximate l (δ1, δ2,…, δt)-coloring of trees and interval graphs. Networks: An International Journal, 49(3):204–216, 2007.