You are seeing a free-to-access but limited selection of the activity Altmetric has collected about this research output.
Click here to find out more.
Mendeley readers
Chapter title |
On the Complexity of Train Assignment Problems
|
---|---|
Chapter number | 34 |
Book title |
Algorithms and Computation
|
Published in |
Lecture notes in computer science, December 2001
|
DOI | 10.1007/3-540-45678-3_34 |
Book ISBNs |
978-3-54-042985-2, 978-3-54-045678-0
|
Authors |
Thomas Erlebach, Martin Gantenbein, Daniel Hürlimann, Gabriele Neyer, Aris Pagourtzis, Paolo Penna, Konrad Schlude, Kathleen Steinhöfel, David Scot Taylor, Peter Widmayer, Erlebach, Thomas, Gantenbein, Martin, Hürliman, Daniel, Neyer, Gabriele, Pagourtzis, Aris, Penna, Paolo, Schlude, Konrad, Steinöfel, Kathleen, Taylor, David S., Widmayer, Peter |
Mendeley readers
The data shown below were compiled from readership statistics for 6 Mendeley readers of this research output. Click here to see the associated Mendeley record.
Geographical breakdown
Country | Count | As % |
---|---|---|
Switzerland | 1 | 17% |
Unknown | 5 | 83% |
Demographic breakdown
Readers by professional status | Count | As % |
---|---|---|
Professor | 1 | 17% |
Student > Ph. D. Student | 1 | 17% |
Researcher | 1 | 17% |
Lecturer | 1 | 17% |
Unknown | 2 | 33% |
Readers by discipline | Count | As % |
---|---|---|
Computer Science | 3 | 50% |
Unknown | 3 | 50% |