scientific article; zbMATH DE number 2079395

MaRDI QIDQ4471354zbMATH OpenFDO

Authors Maxim Sviridenko, Moshe Lewenstein

Publication date 28 July 2004

Mathematics Subject Classification ID

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

Recommendations

• A 5/8 Approximation Algorithm for the Maximum Asymmetric TSP
• Simpler approximation of the maximum asymmetric traveling salesman problem
• 35/44-Approximation for Asymmetric Maximum TSP with Triangle Inequality
• 35/44-approximation for asymmetric maximum TSP with triangle inequality
• Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques

Cited in

(6)

• Asymptotically optimal algorithms for geometric MAX TSP and MAX \(m\)-PSP
• On the core of multiple longest traveling salesman games
• Simpler approximation of the maximum asymmetric traveling salesman problem
• Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs
• A 5/8 Approximation Algorithm for the Maximum Asymmetric TSP
• Maximum Scatter TSP in Doubling Metrics

This page was built for publication:

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