On the maximum TSP with \(\gamma\)-parameterized triangle inequality

DOI10.1007/S11590-010-0266-YzbMath1258.90097OpenAlexW2045917532MaRDI QIDQ691373

Weidong Li, Yaomin Shi

Publication date: 30 November 2012

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-010-0266-y

zbMATH Keywords

approximation algorithmmaximum traveling salesman problemparameterized triangle inequality

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Cites Work

• Unnamed Item
• Unnamed Item
• An improved approximation algorithm for the maximum TSP
• Deterministic 7/8-approximation for the metric maximum TSP
• Improved deterministic approximation algorithms for max TSP
• Better approximations for max TSP
• A \(\frac78\)-approximation algorithm for metric Max TSP
• Improved approximation algorithms for metric MaxTSP
• Encyclopedia of Optimization
• A 7/9 - Approximation Algorithm for the Maximum Traveling Salesman Problem
• An Analysis of Approximations for Finding a Maximum Weight Hamiltonian Circuit

This page was built for publication: On the maximum TSP with \(\gamma\)-parameterized triangle inequality