Karthik Visweswariah, Sanjeev Kulkarni, et al.
IEEE International Symposium on Information Theory - Proceedings
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.
Karthik Visweswariah, Sanjeev Kulkarni, et al.
IEEE International Symposium on Information Theory - Proceedings
Naga Ayachitula, Melissa Buco, et al.
SCC 2007
A. Gupta, R. Gross, et al.
SPIE Advances in Semiconductors and Superconductors 1990
Ligang Lu, Jack L. Kouloheris
IS&T/SPIE Electronic Imaging 2002