Name
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. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1007/978-3-642-30347-0_8 | FUN |
Keywords | Field | DocType |
auxiliary rail,train marshalling,parameter tractable | Clique number,NP-complete,Interval graph,Computer science,Marshalling,Algorithm | Conference |
Citations | PageRank | References |
4 | 0.47 | 1 |
Authors | ||
8 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Leo Brueggeman | 1 | 4 | 0.47 |
| Michael R. Fellows | 2 | 4138 | 319.37 |
| Rudolf Fleischer | 3 | 949 | 85.69 |
| Martin Lackner | 4 | 25 | 5.34 |
| Christian Komusiewicz | 5 | 461 | 46.04 |
| Yiannis Koutis | 6 | 4 | 0.47 |
| Andreas Pfandler | 7 | 95 | 10.98 |
| Frances A. Rosamond | 8 | 684 | 34.52 |