Parameterized complexity of the k-arc Chinese Postman Problem
- Submitting institution
-
Royal Holloway and Bedford New College
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 28975257
- Type
- D - Journal article
- DOI
-
10.1016/j.jcss.2016.07.006
- Title of journal
- Journal of Computer and System Sciences
- Article number
- -
- First page
- 107
- Volume
- 84
- Issue
- -
- ISSN
- 0022-0000
- Open access status
- Compliant
- Month of publication
- September
- Year of publication
- 2016
- URL
-
-
- Supplementary information
-
-
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
2
- Research group(s)
-
-
- Citation count
- 6
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- This output resulted from Gutin's Royal Society Wolsfson Research Merit Award (2014-2018), and it is the second paper out of three publications that address the problem mentioned in the original research application. arXiv versions of the three papers led to revision of a preliminary version of van Bevern et al., Complexity of arc routing problems, Chapter 2 in Arc Routing: Problems, Methods, and Applications, SIAM, 2015. Gutin gave an invited talk on this paper at the Bertinoro Workshop on approximation and parameterized algorithms (Italy, May 2014).
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -