Parameterized Complexity of the $k$-Arc Chinese Postman Problem

Gregory Gutin, Mark Jones, Bin Sheng

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

232 Downloads (Pure)

Original language	Undefined/Unknown
Title of host publication	European Symposium on Algorithms 2014
Publisher	Springer-Verlag
Pages	530-541
Volume	8737
Publication status	Published - 6 Mar 2014

Name	Lecture Notes in Computer Science
Publisher	Springer
Volume	8737

Keywords

@inproceedings{cb23e145da4b4be18f110e5b867da1ef,

title = "Parameterized Complexity of the $k$-Arc Chinese Postman Problem",

keywords = "cs.DS, cs.CC",

author = "Gregory Gutin and Mark Jones and Bin Sheng",

year = "2014",

month = mar,

day = "6",

language = "Undefined/Unknown",

volume = "8737",

series = "Lecture Notes in Computer Science",

publisher = "Springer-Verlag",

pages = "530--541",

booktitle = "European Symposium on Algorithms 2014",

}