Yi Zhou, Parikshit Ram, et al.
ICLR 2023
We consider an APX-hard variant (Δ-Max-ATSP) and an APX-hard relaxation (Max-3-DCC) of the classical traveling salesman problem. We present a frac(31, 40)-approximation algorithm for Δ-Max-ATSP and a frac(3, 4)-approximation algorithm for Max-3-DCC with polynomial running time. The results are obtained via a new way of applying techniques for computing undirected cycle covers to directed problems. © 2009 Elsevier B.V. All rights reserved.
Yi Zhou, Parikshit Ram, et al.
ICLR 2023
W.F. Cody, H.M. Gladney, et al.
SPIE Medical Imaging 1994
A.R. Conn, Nick Gould, et al.
Mathematics of Computation
Naga Ayachitula, Melissa Buco, et al.
SCC 2007