"On the Complexity of Train Assignment Problems."

Thomas Erlebach et al. (2001)

> Home

Details and statistics

DOI: 10.1007/3-540-45678-3_34

access: closed

type: Conference or Workshop Paper

metadata version: 2024-10-06

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/isaac/ErlebachGHNPPSSTW01
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/isaac/ErlebachGHNPPSSTW01
Thomas Erlebach, Martin Gantenbein, Daniel Hürlimann, Gabriele Neyer, Aris Pagourtzis, Paolo Penna, Konrad Schlude, Kathleen Steinhöfel, David Scot Taylor, Peter Widmayer:
On the Complexity of Train Assignment Problems. ISAAC 2001: 390-402

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.