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.

Item Type:	Conference or Workshop Item (Paper)
Subjects:	UNSPECIFIED
ID Code:	1231
Deposited By:	Dr Tomasz Radzik
Deposited On:	16 Nov 2007 18:52
Last Modified:	16 Nov 2007 19:19

Repository Staff Only: item control page

Accessibility | Terms and Conditions | Last Modified 01 November 2007