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.