|Home Latest Advanced Search By Year By Division|
|Not Logged in. Login|
On the Complexity of Train Assignment Problems
Erlebach, Thomas and Gantenbein, Martin and Hurlimann, Daniel and Neyer, Gabriele and Pagourtzis, Aris and Penna, Paolo and Schlude, Konrad and Steinhofel, Kathleen and Taylor, David Scot and Widmayer, Peter (2001) On the Complexity of Train Assignment Problems. In: Algorithms and Computation, 12th International Symposium, ISAAC 2001, Christchurch, New Zealand, December 19-21, 2001, Proceedings.
Full text not available from this repository.
Repository Staff Only: item control page