Train Marshalling Is Fixed Parameter Tractable
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.
KeywordsInterval Graph Active Segment Clique Number Discrete Apply Mathematic Proper Interval
Unable to display preview. Download preview PDF.
- 1.Acta Mathematicae Applicatae Sinica 1(2), 91–105 (1978)Google Scholar
- 2.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