On the maximum TSP with -parameterized triangle inequality

DOI10.1007/S11590-010-0266-YzbMATH Open1258.90097OpenAlexW2045917532MaRDI QIDQ691373FDOQ691373

Authors: 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

Recommendations

• An improved approximation algorithm for the maximum TSP
• An improved approximation algorithm for the ATSP with parameterized triangle inequality
• An improved approximation algorithm for the asymmetric TSP with strengthened triangle inequality
• scientific article; zbMATH DE number 2038707
• scientific article; zbMATH DE number 2086388

zbMATH Keywords

approximation algorithmmaximum traveling salesman problemparameterized triangle inequality

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (1)

• An improved approximation algorithm for the maximum TSP

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q691373)