Differential approximation results for the traveling salesman and related problems
From MaRDI portal
(Redirected from Publication:294874)
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
Cites work
- scientific article; zbMATH DE number 3910163 (Why is no real title available?)
- scientific article; zbMATH DE number 3467157 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1754594 (Why is no real title available?)
- scientific article; zbMATH DE number 1839451 (Why is no real title available?)
- A \(\frac78\)-approximation algorithm for metric Max TSP
- An Analysis of Approximations for Finding a Maximum Weight Hamiltonian Circuit
- An approximation algorithm for the asymmetric travelling salesman problem with distances one and two
- Approximate solution of NP optimization problems
- Bridging gap between standard and differential polynomial approximation: The case of bin-packing
- Completeness in approximation classes
- Covering Points of a Digraph with Point-Disjoint Paths and Its Application to Code Optimization
- Differential approximation algorithms for some combinatorial optimization problems
- On an approximation measure founded on the links between optimization and polynomial approximation theory
- On mapping processes to processors in distributed systems
- P-Complete Approximation Problems
- Reducibility among combinatorial problems
- Structure preserving reductions among convex optimization problems
- The Traveling Salesman Problem with Distances One and Two
- \(z\)-approximations
Cited in
(16)- Differential approximation of NP-hard problems with equal size feasible solutions
- Approximating the Pareto curve with local search for the bicriteria TSP(1,2) problem
- COMPLETENESS IN DIFFERENTIAL APPROXIMATION CLASSES
- Differential approximation algorithm of FSMVRP
- scientific article; zbMATH DE number 1839451 (Why is no real title available?)
- Differential approximation results for the traveling salesman problem with distances 1 and 2
- New differential approximation algorithm for \(k\)-customer vehicle routing problem
- Towards the notion of stability of approximation for hard optimization tasks and the traveling salesman problem.
- Approximation algorithms for the maximum Hamiltonian path problem with specified endpoint(s)
- Approximation of the double traveling salesman problem with multiple stacks
- A 3/4 differential approximation algorithm for traveling salesman problem
- Approximation results for the weighted \(P_4\) partition problem
- A better differential approximation ratio for symmetric TSP
- Approximation algorithms for the traveling salesman problem
- scientific article; zbMATH DE number 5158919 (Why is no real title available?)
- Approximation algorithms for some vehicle routing problems
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)
