Article citationsMore>>

Z.-Z. Chen, Y. Oka-moto and L. Wang, “Improved Deterministic Approximation Algorithms for Max TSP,” Information Processing Letters, Vol. 95, No. 2, 2005, pp. 333-342. doi:10.1016/j.ipl.2005.03.011

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.