Skip to main content

Train Marshalling Is Fixed Parameter Tractable

  • Conference paper

Part of the Lecture Notes in Computer Science book series (LNTCS,volume 7288)

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.

Keywords

  • Interval Graph
  • Active Segment
  • Clique Number
  • Discrete Apply Mathematic
  • Proper Interval

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (Canada)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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

  3. Dalhaus, E., Horak, P., Miller, M., Ryan, J.F.: The train marshalling problem. Discrete Applied Mathematics 103(1-3), 41–54 (2000)

    CrossRef  MathSciNet  Google Scholar 

  4. Zhu, Y., Zhu, R.: Sequence reconstruction under some order-type constraints. Scientia Sinica 26(7), 702–713 (1983)

    MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints 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)