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 Complexity of min-max (Regret) Versions of Shortest Path, Spanning Tree, and Knapsack
|
---|---|
Chapter number | 76 |
Book title |
Algorithms – ESA 2005
|
Published by |
Springer, Berlin, Heidelberg, October 2005
|
DOI | 10.1007/11561071_76 |
Book ISBNs |
978-3-54-029118-3, 978-3-54-031951-1
|
Authors |
Hassene Aissi, Cristina Bazgan, Daniel Vanderpooten, Aissi, Hassene, Bazgan, Cristina, Vanderpooten, Daniel |
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 % |
---|---|---|
Germany | 1 | 10% |
Unknown | 9 | 90% |
Demographic breakdown
Readers by professional status | Count | As % |
---|---|---|
Student > Doctoral Student | 2 | 20% |
Student > Ph. D. Student | 2 | 20% |
Professor | 1 | 10% |
Student > Master | 1 | 10% |
Researcher | 1 | 10% |
Other | 2 | 20% |
Unknown | 1 | 10% |
Readers by discipline | Count | As % |
---|---|---|
Computer Science | 4 | 40% |
Mathematics | 3 | 30% |
Engineering | 2 | 20% |
Unknown | 1 | 10% |