An approximation algorithm for the maximum traveling salesman problem
From MaRDI portal
Publication:4972196
Recommendations
Cites work
Cited in
(18)- scientific article; zbMATH DE number 598850 (Why is no real title available?)
- A 7/9 - Approximation Algorithm for the Maximum Traveling Salesman Problem
- scientific article; zbMATH DE number 2143861 (Why is no real title available?)
- scientific article; zbMATH DE number 808804 (Why is no real title available?)
- On the relationship of approximation algorithms for the minimum and the maximum traveling salesman problem
- An approximation algorithm with performance guarantees for the maximum traveling salesman problem on special matrices
- scientific article; zbMATH DE number 1855663 (Why is no real title available?)
- scientific article; zbMATH DE number 4031726 (Why is no real title available?)
- Approximation algorithms for traveling salesman problems
- scientific article; zbMATH DE number 3910163 (Why is no real title available?)
- An approximation algorithm for the maximum traveling salesman problem
- A certain generalization of the maximum traveling salesman problem
- scientific article; zbMATH DE number 1534500 (Why is no real title available?)
- Deterministic approximation algorithms for the maximum traveling salesman and maximum triangle packing problems
- scientific article; zbMATH DE number 2080248 (Why is no real title available?)
- scientific article; zbMATH DE number 6007868 (Why is no real title available?)
- A Constant Approximation Algorithm for the a priori Traveling Salesman Problem
- On the approximability of the traveling salesman problem
This page was built for publication: An approximation algorithm for the maximum traveling salesman problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4972196)