Abstract
The train marshalling problem is about reordering the cars of a train using as few auxiliary rails as possible. The problem is known to be NP-complete. We show that it is fixed parameter tractable (FPT) with the number of auxiliary rails as parameter.
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
Acta Mathematicae Applicatae Sinica 1(2), 91–105 (1978)
Dalhaus, E., Horak, P., Miller, M., Ryan, J.F.: Algorithms for combinatorial problems related to train marshalling. CiteSeerX (10.1.1.37.4090) (2000), http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.37.4090
Dalhaus, E., Horak, P., Miller, M., Ryan, J.F.: The train marshalling problem. Discrete Applied Mathematics 103(1-3), 41–54 (2000)
Zhu, Y., Zhu, R.: Sequence reconstruction under some order-type constraints. Scientia Sinica 26(7), 702–713 (1983)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Brueggeman, L. et al. (2012). Train Marshalling Is Fixed Parameter Tractable. In: Kranakis, E., Krizanc, D., Luccio, F. (eds) Fun with Algorithms. FUN 2012. Lecture Notes in Computer Science, vol 7288. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-30347-0_8
Download citation
DOI: https://doi.org/10.1007/978-3-642-30347-0_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-30346-3
Online ISBN: 978-3-642-30347-0
eBook Packages: Computer ScienceComputer Science (R0)