The Maximum Hamilton Path Problem with Parameterized Triangle Inequality

• 作者: Honglin Ding Jianping Li Weidong Li Zefeng Qiao
• 来源期刊: 通讯与网络(英文)
• 学科: 数学
• 关键词: MAXIMUM TRAVELING SALESMAN PROBLEM Parameterized TRIANGLE INEQUALITY Approximation Algorithm
• 年，卷（期）: 2013,（1）
• 页码范围: 96-100
• 页数: 5页
• 分类号: O1

摘要

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