Parameterized complexity of the k-arc Chinese Postman Problem

作者：

Highlights：

• Mixed Chinese Postman problem.

• Parameterized by number of arcs.

• Fixed parameter tractable.

摘要

•Mixed Chinese Postman problem.•Parameterized by number of arcs.•Fixed parameter tractable.

论文关键词：Mixed Chinese Postman problem,Fixed parameter tractable

论文评审过程：Received 4 August 2014, Revised 29 December 2015, Accepted 23 July 2016, Available online 9 September 2016, Version of Record 14 November 2016.

论文官网地址：https://doi.org/10.1016/j.jcss.2016.07.006