An approximation algorithm for the maximum traveling salesman problem
DOI10.1016/S0020-0190(98)00102-1zbMATH Open1339.90282MaRDI QIDQ293334FDOQ293334
Authors: Refael Hassin, Shlomi Rubinstein 
Publication date: 9 June 2016
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: http://www.sciencedirect.com/science/article/pii/S0020019098001021?np=y
Recommendations
Approximation methods and heuristics in mathematical programming (90C59) Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27) Approximation algorithms (68W25)
Cites Work
- Two Algorithmic Results for the Traveling Salesman Problem
- An approximation algorithm for maximum packing of 3-edge paths
- A fast and simple randomized parallel algorithm for the maximal independent set problem
- An Analysis of Approximations for Finding a Maximum Weight Hamiltonian Circuit
- Maximizing traveling salesman problem for special matrices
- The maximum travelling salesman problem on symmetric Demidenko matrices
- An Analysis of the Greedy Heuristic for Independence Systems
Cited In (26)
- Title not available (Why is that?)
- A 7/9 - Approximation Algorithm for the Maximum Traveling Salesman Problem
- A 4/5 -- approximation algorithm for the maximum traveling salesman problem
- Title not available (Why is that?)
- An improved approximation algorithm for the maximum TSP
- Improved deterministic approximation algorithms for max TSP
- 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
- Better Approximation Algorithms for Scaffolding Problems
- The lazy bureaucrat scheduling problem
- Title not available (Why is that?)
- Approximation algorithms for multi-criteria traveling salesman problems
- Better approximations for max TSP
- An approximation algorithm for the maximum traveling salesman problem
- Approximation algorithms for the scaffolding problem and its generalizations
- On lazy bureaucrat scheduling with common deadlines
- A certain generalization of the maximum traveling salesman problem
- An improved randomized approximation algorithm for Max TSP
- 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
- THE MAXIMUM TRAVELING SALESMAN PROBLEM ON BANDED MATRICES
- On the approximability of the traveling salesman problem
- The maximum resource bin packing 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 Q293334)
