Parameterized complexity of the k-arc Chinese Postman Problem

Download PDF
Open Webpage

Gregory Z. Gutin, Mark Jones, Bin Sheng

Published: 01 Jan 2017, Last Modified: 05 Feb 2025J. Comput. Syst. Sci. 2017EveryoneRevisionsBibTeXCC BY-SA 4.0
Abstract: Highlights•Mixed Chinese Postman problem.•Parameterized by number of arcs.•Fixed parameter tractable.