The Maximum Hamilton Path Problem with Parameterized Triangle Inequality - Communications and Network

CN > Vol.5 No.1, February 2013

The Maximum Hamilton Path Problem with Parameterized Triangle Inequality ()

HTML

Download as PDF (Size: 84KB) PP. 96-100

DOI: 10.4236/cn.2013.51B022 2,945 Downloads 4,253 Views

Author(s)

Weidong Li, Jianping Li, Zefeng Qiao, Honglin Ding

Affiliation(s)

Yunnan University, Kunming, PR China.

ABSTRACT

Given a complete graph with edge-weights satisfying parameterized triangle inequality, we consider the maximum Hamilton path problem and design some approximation algorithms.

KEYWORDS

Maximum Traveling Salesman Problem; Parameterized Triangle Inequality; Approximation Algorithm

Share and Cite:

Li, W. , Li, J. , Qiao, Z. and Ding, H. (2013) The Maximum Hamilton Path Problem with Parameterized Triangle Inequality. Communications and Network, 5, 96-100. doi: 10.4236/cn.2013.51B022.

Journals Menu