Parameterized Complexity of the $k$-Arc Chinese Postman Problem. / Gutin, Gregory; Jones, Mark; Sheng, Bin.

European Symposium on Algorithms 2014. Vol. 8737 Springer-Verlag, 2014. p. 530-541 (Lecture Notes in Computer Science; Vol. 8737).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Published

Documents

Original languageUndefined/Unknown
Title of host publicationEuropean Symposium on Algorithms 2014
PublisherSpringer-Verlag
Pages530-541
Volume8737
Publication statusPublished - 6 Mar 2014

Publication series

NameLecture Notes in Computer Science
PublisherSpringer
Volume8737
This open access research output is licenced under a Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported License.

ID: 23143534