%0 Journal Article
%T The Maximum Hamilton Path Problem with Parameterized Triangle Inequality
%A Weidong Li
%A Jianping Li
%A Zefeng Qiao
%A Honglin Ding
%J Communications and Network
%P 96-100
%@ 1947-3826
%D 2013
%I Scientific Research Publishing
%R 10.4236/cn.2013.51B022
%X Given a complete graph with edge-weights satisfying parameterized triangle inequality, we consider the maximum Hamilton path problem and design some approximation algorithms.
%K Maximum Traveling Salesman Problem
%K Parameterized Triangle Inequality
%K Approximation Algorithm
%U http://www.scirp.org/journal/PaperInformation.aspx?PaperID=39136