R. Hassin, S. Rubinstein, “A 7/8-approximation Algorithm Formetric Max TSP,” Information Processing Letters, Vol. 81, No. 5, 2002, pp. 247-251. doi:10.1016/S0020-0190(01)00234-4

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.