Parameterized Complexity of the k-Arc Chinese Postman Problem

Gregory Gutin, Mark Jones, Bin Sheng. Parameterized Complexity of the k-Arc Chinese Postman Problem. In Andreas S. Schulz, Dorothea Wagner, editors, Algorithms - ESA 2014 - 22th Annual European Symposium, Wroclaw, Poland, September 8-10, 2014. Proceedings. Volume 8737 of Lecture Notes in Computer Science, pages 530-541, Springer, 2014. [doi]

Abstract

Abstract is missing.