R. Hassin and S. Rubinstein, “Better Approximations for Max TSP. Information Processing Letters, Vol. 75, No. 4, 2000, pp. 181-186. doi:10.1016/S0020-0190(00)00097-1
has been cited by the following article:
TITLE: The Maximum Hamilton Path Problem with Parameterized Triangle Inequality
AUTHORS: Weidong Li, Jianping Li, Zefeng Qiao, Honglin Ding
KEYWORDS: Maximum Traveling Salesman Problem; Parameterized Triangle Inequality; Approximation Algorithm
JOURNAL NAME: Communications and Network, Vol.5 No.1B, November 7, 2013
ABSTRACT: Given a complete graph with edge-weights satisfying parameterized triangle inequality, we consider the maximum Hamilton path problem and design some approximation algorithms.