An -approximation algorithm for the asymmetric maximum TSP

DOI10.1016/S0196-6774(03)00112-3zbMATH Open1106.68120MaRDI QIDQ4819692FDOQ4819692

Authors: Markus Bläser 

Publication date: 4 October 2004

Published in: Journal of Algorithms (Search for Journal in Brave)

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation algorithms (68W25)

Cited In (9)

• 35/44-approximation for asymmetric maximum TSP with triangle inequality
• Improved approximation algorithms for metric maximum ATSP and maximum 3-cycle cover problems
• Title not available (Why is that?)
• A posteriori analysis of the algorithms for two-bar charts packing problem
• An improved approximation algorithm for the maximum TSP
• A new approximation algorithm for the asymmetric TSP with triangle inequality
• Three-Bar Charts Packing Problem
• Deterministic 7/8-Approximation for the Metric Maximum TSP
• An experimental study of a hybrid genetic algorithm for the maximum traveling salesman problem

This page was built for publication: An -approximation algorithm for the asymmetric maximum TSP

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