An O( n/ n)-approximation algorithm for the asymmetric traveling salesman problem
From MaRDI portal
(Redirected from Publication:5360842)
An \(O(\log n/\log \log n)\)-approximation algorithm for the asymmetric traveling salesman problem
An \(O(\log n/\log \log n)\)-approximation algorithm for the asymmetric traveling salesman problem
Recommendations
- An \(O(\log n/ \log \log n)\)-approximation algorithm for the asymmetric traveling salesman problem
- scientific article; zbMATH DE number 5899262
- Improved approximation algorithm for the asymmetric prize-collecting TSP
- A Constant-factor Approximation Algorithm for the Asymmetric Traveling Salesman Problem
- An O(logn) Approximation Ratio for the Asymmetric Traveling Salesman Path Problem
Cited in
(33)- Efficient constructions of convex combinations for 2-edge-connected subgraphs on fundamental classes
- From symmetry to asymmetry: generalizing TSP approximations by parametrization
- 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
- scientific article; zbMATH DE number 5899262 (Why is no real title available?)
- Approximation algorithms for the bottleneck asymmetric traveling salesman problem
- A near-optimal approximation algorithm for asymmetric TSP on embedded graphs
- Approximation Algorithms for the Bottleneck Asymmetric Traveling Salesman Problem
- On the computability of continuous maximum entropy distributions with applications
- 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
- Efficient large-scale multi-drone delivery using transit networks
- An Improved Approximation Algorithm for The Asymmetric Traveling Salesman Problem
- Maximum entropy and integer partitions
- The temporal explorer who returns to the base
- From symmetry to asymmetry: generalizing TSP approximations by parametrization
- Polyhedral techniques in combinatorial optimization: matchings and tours
- 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
- An improved approximation guarantee for prize-collecting TSP
- The simultaneous semi-random model for TSP
- Matroid-based TSP rounding for half-integral solutions
- A transient equivalence between Aldous-Broder and Wilson's algorithms and a two-stage framework for generating uniform spanning trees
- Two-commodity opposite direction network flow formulations for the travelling salesman problem
- A lower bound for the max entropy algorithm for TSP
- A lower bound for the max entropy algorithm for TSP
- The indefinite period traveling salesman problem
- 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
- Dual charging for half-integral TSP
- Maximum entropy is a 10/7-approximation algorithm for the TSP on half-integral cycle cut instances
- Parameterized complexity of directed traveling salesman problem
This page was built for publication: An \(O(\log n/\log \log n)\)-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 Q5360842)
