Maximum ATSP with weights zero and one via half-edges
From MaRDI portal
DOI10.1007/s00224-017-9818-1zbMath1390.90479arXiv1408.1431OpenAlexW2949632898MaRDI QIDQ1743116
Publication date: 12 April 2018
Published in: Theory of Computing Systems, Approximation and Online Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1408.1431
Related Items (5)
A Posteriori Analysis of the Algorithms for Two-Bar Charts Packing Problem ⋮ Three-Bar Charts Packing Problem ⋮ An improved approximation for packing big two-bar charts ⋮ New Approximation Algorithms for (1,2)-TSP ⋮ Maximum ATSP with weights zero and one via half-edges
Cites Work
- Unnamed Item
- Unnamed Item
- An approximation algorithm for the asymmetric travelling salesman problem with distances one and two
- Maximum ATSP with weights zero and one via half-edges
- Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs
- A 5/8 Approximation Algorithm for the Maximum Asymmetric TSP
- An -approximation algorithm for the asymmetric maximum TSP
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
This page was built for publication: Maximum ATSP with weights zero and one via half-edges