A Constant-factor Approximation Algorithm for the Asymmetric Traveling Salesman Problem
From MaRDI portal
Recommendations
- A constant-factor approximation algorithm for the asymmetric traveling salesman problem
- Constant factor approximation for ATSP with two edge weights (extended abstract)
- An improved approximation algorithm for ATSP
- Constant factor approximation for ATSP with two edge weights
- An \(O(\log n/\log \log n)\)-approximation algorithm for the asymmetric traveling salesman problem
Cited in
(30)- Constant factor approximation for ATSP with two edge weights
- Angular bisector insertion algorithm for solving small-scale symmetric and asymmetric traveling salesman problem
- The simultaneous semi-random model for TSP
- Constant-factor approximation algorithms for a series of combinatorial routing problems based on the reduction to the asymmetric traveling salesman problem
- Combinatorial optimization. Abstracts from the workshop held November 7--13, 2021 (hybrid meeting)
- scientific article; zbMATH DE number 5899262 (Why is no real title available?)
- Constant factor approximation for ATSP with two edge weights (extended abstract)
- Constant-factor approximations for asymmetric TSP on nearly-embeddable graphs
- scientific article; zbMATH DE number 6178353 (Why is no real title available?)
- A constant-factor approximation algorithm for the asymmetric traveling salesman problem
- An \(O(\log n/\log \log n)\)-approximation algorithm for the asymmetric traveling salesman problem
- The asymmetric traveling salesman problem on graphs with bounded genus
- An Improved Approximation Algorithm for The Asymmetric Traveling Salesman Problem
- Auction algorithm sensitivity for multi-robot task allocation
- From symmetry to asymmetry: generalizing TSP approximations by parametrization
- Polyhedral techniques in combinatorial optimization: matchings and tours
- Approximation algorithms for the min-max mixed rural postmen cover problem and its variants
- Approximation algorithms with constant factors for a series of asymmetric routing problems
- Polynomial-time approximability of the asymmetric problem of covering a graph by a bounded number of cycles
- The simultaneous semi-random model for TSP
- Multi-candidate carpooling routing problem and its approximation algorithms
- Approximations for the Steiner multicycle problem
- Improved first player strategy for the zero-sum sequential uncrossing game
- Exact and approximation algorithms for routing a convoy through a graph
- A survey on approximability of traveling salesman problems using the TSP-T3CO definition scheme
- Exact exponential algorithms for clustering problems
- On the windy k-traveling salesman problem
- Implementation and numerical evaluation of Traub and Vygen algorithm for the subtour cover problem
- Constant-ratio polynomial time approximation of the asymmetric minimum weight cycle cover problem with limited number of cycles
- LP-based solution methods for the asymmetric TSP
This page was built for publication: A Constant-factor Approximation Algorithm for the Asymmetric Traveling Salesman Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5056450)
