Article citationsMore>>

K. Paluch, M. Mucha and A. Madry, “A 7/9 approximation Algorithm for the Maximum Traveling Salesman Problem,” Lecture Notes In Computer Science, Vol. 5687, 2009, pp. 298-311. doi:10.1007/978-3-642-03685-9_23

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.