Skip to main content
Conference Proceedings

Train marshalling is fixed parameter tractable

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2012) 7288 LNCS 51-56
DOI: 10.1007/978-3-642-30347-0_8
8Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

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. © 2012 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Brueggeman, L., Fellows, M., Fleischer, R., Lackner, M., Komusiewicz, C., Koutis, Y., … Rosamond, F. (2012). Train marshalling is fixed parameter tractable. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7288 LNCS, pp. 51–56). https://doi.org/10.1007/978-3-642-30347-0_8

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free