Approximation Algorithms for the Traveling Salesman Problem with Range Condition
From MaRDI portal
Recommendations
- Towards the notion of stability of approximation for hard optimization tasks and the traveling salesman problem.
- scientific article; zbMATH DE number 4095236
- Towards the notion of stability of approximation for hard optimization tasks and the traveling salesman problem
- On the traveling salesman problem restricted to inputs satisfying a relaxed triangle inequality
- The Traveling Salesman Problem with Distances One and Two
Cites work
- An improved lower bound on the approximability of metric TSP and approximation algorithms for the TSP with sharpened triangle inequality (extended abstract)
- Faster scaling algorithms for general graph matching problems
- scientific article; zbMATH DE number 3588048 (Why is no real title available?)
- scientific article; zbMATH DE number 3409134 (Why is no real title available?)
- Performance Guarantees for Approximation Algorithms Depending on Parametrized Triangle Inequalities
- Performance guarantees for the TSP with a parametrized triangle inequality
- Stability of approximation algorithms and the knapsack problem
- Stability of approximation algorithms for hard optimization problems
- The Euclidean traveling salesman problem is NP-complete
- The Traveling Salesman Problem with Distances One and Two
This page was built for publication: Approximation Algorithms for the Traveling Salesman Problem with Range Condition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4522112)