Differential approximation results for the traveling salesman and related problems
From MaRDI portal
Publication:294874
DOI10.1016/S0020-0190(01)00287-3zbMath1338.68294WikidataQ127007641 ScholiaQ127007641MaRDI QIDQ294874
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
Programming involving graphs or networks (90C35) Analysis of algorithms (68W40) Combinatorial optimization (90C27) Paths and cycles (05C38) Approximation algorithms (68W25)
Related Items (9)
Differential approximation algorithm of FSMVRP ⋮ Approximating the Pareto curve with local search for the bicriteria TSP(1,2) problem ⋮ A 3/4 differential approximation algorithm for traveling salesman problem ⋮ A better differential approximation ratio for symmetric TSP ⋮ Approximation results for the weighted \(P_4\) partition problem ⋮ COMPLETENESS IN DIFFERENTIAL APPROXIMATION CLASSES ⋮ Approximation algorithms for some vehicle routing problems ⋮ New differential approximation algorithm for \(k\)-customer vehicle routing problem ⋮ Approximation of the double traveling salesman problem with multiple stacks
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Approximate solution of NP optimization problems
- Completeness in approximation classes
- On mapping processes to processors in distributed systems
- Structure preserving reductions among convex optimization problems
- An approximation algorithm for the asymmetric travelling salesman problem with distances one and two
- Differential approximation algorithms for some combinatorial optimization problems
- On an approximation measure founded on the links between optimization and polynomial approximation theory
- A \(\frac78\)-approximation algorithm for metric Max TSP
- Bridging gap between standard and differential polynomial approximation: The case of bin-packing
- z-Approximations
- P-Complete Approximation Problems
- Covering Points of a Digraph with Point-Disjoint Paths and Its Application to Code Optimization
- An Analysis of Approximations for Finding a Maximum Weight Hamiltonian Circuit
- The Traveling Salesman Problem with Distances One and Two
- Reducibility among Combinatorial Problems
This page was built for publication: Differential approximation results for the traveling salesman and related problems
