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 |
Approximation Algorithms for the Minimum Bends Traveling Salesman Problem
|
---|---|
Chapter number | 32 |
Book title |
Integer Programming and Combinatorial Optimization
|
Published by |
Springer Berlin Heidelberg, June 2001
|
DOI | 10.1007/3-540-45535-3_32 |
Book ISBNs |
978-3-54-042225-9, 978-3-54-045535-6
|
Authors |
Clifford Stein?, David P. Wagner* |
Editors |
Karen Aardal, Bert Gerards |
Mendeley readers
The data shown below were compiled from readership statistics for 10 Mendeley readers of this research output. Click here to see the associated Mendeley record.
Geographical breakdown
Country | Count | As % |
---|---|---|
Unknown | 10 | 100% |
Demographic breakdown
Readers by professional status | Count | As % |
---|---|---|
Student > Doctoral Student | 2 | 20% |
Researcher | 2 | 20% |
Lecturer > Senior Lecturer | 1 | 10% |
Student > Ph. D. Student | 1 | 10% |
Student > Bachelor | 1 | 10% |
Other | 2 | 20% |
Unknown | 1 | 10% |
Readers by discipline | Count | As % |
---|---|---|
Computer Science | 5 | 50% |
Engineering | 2 | 20% |
Business, Management and Accounting | 1 | 10% |
Unknown | 2 | 20% |