The Maximum Hamilton Path Problem with Parameterized Triangle Inequality

Weidong Li, Jianping Li, Zefeng Qiao, Honglin Ding
2013 Communications and Network  
Given a complete graph with edge-weights satisfying parameterized triangle inequality, we consider the maximum-Hamilton path problem and design some approximation algorithms.
doi:10.4236/cn.2013.51b022 fatcat:cjedtbhhvrhhdbwizbbme5yez4