An approximation algorithm for the maximum traveling salesman problem
From MaRDI portal
Publication:4972196
DOI10.14529/JCEM170306zbMATH Open1432.90132OpenAlexW2766731260MaRDI QIDQ4972196FDOQ4972196
Authors: A. Yu. Evnin, Natal'Ya Igorevna Yusova
Publication date: 23 November 2019
Published in: Journal of Computational and Engineering Mathematics (Search for Journal in Brave)
Full work available at URL: http://mathnet.ru/eng/jcem99
Recommendations
matchingapproximation algorithmHamiltonian cycletraveling salesman problemcycle coveraccuracy of solution
Cites Work
Cited In (18)
- Title not available (Why is that?)
- A 7/9 - Approximation Algorithm for the Maximum Traveling Salesman Problem
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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
- Title not available (Why is that?)
- Approximation algorithms for traveling salesman problems
- Title not available (Why is that?)
- Title not available (Why is that?)
- An approximation algorithm for the maximum traveling salesman problem
- A certain generalization of the maximum traveling salesman problem
- Title not available (Why is that?)
- Deterministic approximation algorithms for the maximum traveling salesman and maximum triangle packing problems
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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)