Constant-Factor Approximation Algorithms for a Series of Combinatorial Routing Problems Based on the Reduction to the Asymmetric Traveling Salesman Problem
Crossref DOI link: https://doi.org/10.1134/S0081543822060128
Published Online: 2023-02-16
Published Print: 2022-12
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Khachay, M. Yu.
Neznakhina, E. D.
Ryzhenko, K. V.
Text and Data Mining valid from 2022-12-01
Version of Record valid from 2022-12-01
Article History
Received: 12 May 2022
Revised: 14 June 2022
Accepted: 20 June 2022
First Online: 16 February 2023
CONFLICT OF INTEREST
: The authors declare that they have no conflicts of interest.