Approximations for ATSP with parametrized triangle inequality
From MaRDI portal
Recommendations
- An improved approximation algorithm for the ATSP with parameterized triangle inequality
- On the relationship between ATSP and the cycle cover problem
- An improved approximation algorithm for the asymmetric TSP with strengthened triangle inequality
- An improved approximation algorithm for the asymmetric TSP with strengthened triangle inequality
- Two Approximation Algorithms for ATSP with Strengthened Triangle Inequality
Cited in
(13)- Lower tolerance-based branch and bound algorithms for the ATSP
- From symmetry to asymmetry: generalizing TSP approximations by parametrization
- Two Approximation Algorithms for ATSP with Strengthened Triangle Inequality
- An improved approximation algorithm for the ATSP with parameterized triangle inequality
- An improved approximation algorithm for the asymmetric TSP with strengthened triangle inequality
- An improved approximation algorithm for ATSP
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
- Approximating survivable networks with \(\beta \)-metric costs
- From symmetry to asymmetry: generalizing TSP approximations by parametrization
- On the maximum TSP with -parameterized triangle inequality
- On the hardness of constructing minimal 2-connected spanning subgraphs in complete graphs with sharpened triangle inequality
- An improved approximation algorithm for the asymmetric TSP with strengthened triangle inequality
- On the relationship between ATSP and the cycle cover problem
This page was built for publication: Approximations for ATSP with parametrized triangle inequality
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4736842)
