Differential approximation results for the traveling salesman and related problems
DOI10.1016/S0020-0190(01)00287-3zbMATH Open1338.68294WikidataQ127007641 ScholiaQ127007641MaRDI QIDQ294874FDOQ294874
Authors: Jérôme Monnot 
Publication date: 16 June 2016
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: http://www.sciencedirect.com/science/article/pii/S0020019001002873?np=y
Recommendations
- scientific article; zbMATH DE number 1839451
- Differential approximation results for the traveling salesman problem with distances 1 and 2
- Approximation algorithms for the traveling salesman problem
- A better differential approximation ratio for symmetric TSP
- Improved deterministic approximation algorithms for max TSP
Programming involving graphs or networks (90C35) Analysis of algorithms (68W40) Combinatorial optimization (90C27) Approximation algorithms (68W25) Paths and cycles (05C38)
Cites Work
- Title not available (Why is that?)
- Reducibility among combinatorial problems
- Structure preserving reductions among convex optimization problems
- Differential approximation algorithms for some combinatorial optimization problems
- On an approximation measure founded on the links between optimization and polynomial approximation theory
- \(z\)-approximations
- P-Complete Approximation Problems
- The Traveling Salesman Problem with Distances One and Two
- An Analysis of Approximations for Finding a Maximum Weight Hamiltonian Circuit
- On mapping processes to processors in distributed systems
- An approximation algorithm for the asymmetric travelling salesman problem with distances one and two
- A \(\frac78\)-approximation algorithm for metric Max TSP
- Bridging gap between standard and differential polynomial approximation: The case of bin-packing
- Title not available (Why is that?)
- Title not available (Why is that?)
- Covering Points of a Digraph with Point-Disjoint Paths and Its Application to Code Optimization
- Title not available (Why is that?)
- Title not available (Why is that?)
- Approximate solution of NP optimization problems
- Completeness in approximation classes
Cited In (16)
- Approximation of the double traveling salesman problem with multiple stacks
- Approximation algorithms for the maximum Hamiltonian path problem with specified endpoint(s)
- Differential approximation algorithm of FSMVRP
- A better differential approximation ratio for symmetric TSP
- Title not available (Why is that?)
- New differential approximation algorithm for \(k\)-customer vehicle routing problem
- Title not available (Why is that?)
- Approximation algorithms for some vehicle routing problems
- COMPLETENESS IN DIFFERENTIAL APPROXIMATION CLASSES
- Approximation algorithms for the traveling salesman problem
- Approximating the Pareto curve with local search for the bicriteria TSP(1,2) problem
- Differential approximation results for the traveling salesman problem with distances 1 and 2
- A 3/4 differential approximation algorithm for traveling salesman problem
- Approximation results for the weighted \(P_4\) partition problem
- Differential approximation of NP-hard problems with equal size feasible solutions
- Towards the notion of stability of approximation for hard optimization tasks and the traveling salesman problem.
This page was built for publication: Differential approximation results for the traveling salesman and related problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q294874)
