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 and Approximation of the Min-Sum and Min-Max Disjoint Paths Problems
|
---|---|
Chapter number | 7 |
Book title |
Combinatorics, Algorithms, Probabilistic and Experimental Methodologies
|
Published in |
Lecture notes in computer science, January 2007
|
DOI | 10.1007/978-3-540-74450-4_7 |
Book ISBNs |
978-3-54-074449-8, 978-3-54-074450-4
|
Authors |
Zhang, Peng, Zhao, Wenbo, Peng Zhang, Wenbo Zhao |
Mendeley readers
The data shown below were compiled from readership statistics for 9 Mendeley readers of this research output. Click here to see the associated Mendeley record.
Geographical breakdown
Country | Count | As % |
---|---|---|
Unknown | 9 | 100% |
Demographic breakdown
Readers by professional status | Count | As % |
---|---|---|
Student > Ph. D. Student | 2 | 22% |
Professor > Associate Professor | 2 | 22% |
Lecturer | 1 | 11% |
Student > Master | 1 | 11% |
Unknown | 3 | 33% |
Readers by discipline | Count | As % |
---|---|---|
Mathematics | 2 | 22% |
Chemical Engineering | 1 | 11% |
Computer Science | 1 | 11% |
Agricultural and Biological Sciences | 1 | 11% |
Unknown | 4 | 44% |