Abstract
In the Mixed Chinese Postman Problem (MCPP), given a weighted mixed graph G (G may have both edges and arcs), our aim is to find a minimum weight closed walk traversing each edge and arc at least once. The MCPP parameterized by the number of edges in G or the number of arcs in G is fixed-parameter tractable as proved by van Bevern et al. (2014) and Gutin, Jones and Sheng (2014), respectively. In this paper, we consider the unweighted version of MCPP. Solving an open question of van Bevern et al. (2014), we show that somewhat unexpectedly MCPP parameterized by the (undirected) treewidth of G is W[1]-hard. In fact, we prove that even the MCPP parameterized by the pathwidth of G is W[1]-hard. On the positive side, we show that MCPP parameterized by treedepth is fixed-parameter tractable. We are unaware of any natural graph parameters between pathwidth and treedepth and so our results provide a dichotomy of the complexity of MCPP.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Beltrami, E.J., Bodin, L.D.: Networks and vehicle routing for municipal waste collection. Networks 4(1), 65–94 (1974)
van Bevern, R., Niedermeier, R., Sorge, M., Weller, M.: Complexity of Arc Routing Problems. In: Arc Routing: Problems, Methods and Applications. SIAM (2014)
Bodlaender, H.L., Gilbert, J.R., Hafsteinsson, H., Kloks, T.: Approximating treewidth, pathwidth, frontsize, and shortest elimination tree. Journal of Algorithms 18(2), 238–255 (1995)
Brucker, P.: The Chinese postman problem for mixed graphs. In: Noltemeier, H. (ed.) WG 1980. LNCS, vol. 100, pp. 354–366. Springer, Heidelberg (1981)
Christofides, N.: The optimum traversal of a graph. Omega 1(6), 719–732 (1973)
Dom, M., Lokshtanov, D., Saurabh, S., Villanger, Y.: Capacitated domination and covering: A parameterized perspective. In: Grohe, M., Niedermeier, R. (eds.) IWPEC 2008. LNCS, vol. 5018, pp. 78–91. Springer, Heidelberg (2008)
Downey, R.G., Fellows, M.R.: Fundamentals of Parameterized Complexity. Springer (2013)
Edmonds, J., Johnson, E.L.: Matching, Euler tours and the Chinese postman. Mathematical Programming 5(1), 88–124 (1973)
Eiselt, H.A., Gendreau, M., Laporte, G.: Arc routing problems. I. The Chinese postman problem. Operations Research 43, 231–242 (1995)
Fellows, M., Fomin, F., Lokshtanov, D., Rosamond, F., Saurabh, S., Szeider, S., Thomassen, C.: On the complexity of some colorful problems parameterized by treewidth. Inf. Comput. 209(2), 143–153 (2011)
Fellows, M.R., Hermelin, D., Rosamond, F., Vialette, S.: On the parameterized complexity of multiple-interval graph problems. Theor. Comput. Sci. 410, 53–61 (2009)
Fernandes, C.G., Lee, O., Wakabayashi, Y.: Minimum cycle cover and Chinese postman problems on mixed graphs with bounded tree-width. Discrete Appl. Math. 157(2), 272–279 (2009)
Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer (2006)
Golovach, P.A., Kratochvil, J., Suchy, O.: Parameterized complexity of generalized domination problems. Discrete Appl. Math. 160(6), 780–792 (2012)
Gutin, G., Jones, M., Sheng, B.: Parameterized Complexity of the k-Arc Chinese Postman Problem. In: Schulz, A.S., Wagner, D. (eds.) ESA 2014. LNCS, vol. 8737, pp. 530–541. Springer, Heidelberg (2014)
Gutin, G., Jones, M.: M. Wahlström Structural Parameterizations of the Mixed Chinese Postman Problem. http://arxiv.org/abs/1410.5191
Papadimitriou, C.H.: On the complexity of edge traversing. J. ACM 23, 544–554 (1976)
Peng, Y.: Approximation algorithms for some postman problems over mixed graphs. Chinese J. Oper. Res. 8, 76–80 (1989)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gutin, G., Jones, M., Wahlström, M. (2015). Structural Parameterizations of the Mixed Chinese Postman Problem. In: Bansal, N., Finocchi, I. (eds) Algorithms - ESA 2015. Lecture Notes in Computer Science(), vol 9294. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-48350-3_56
Download citation
DOI: https://doi.org/10.1007/978-3-662-48350-3_56
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-48349-7
Online ISBN: 978-3-662-48350-3
eBook Packages: Computer ScienceComputer Science (R0)