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 |
Lower Bounds for Algorithms for the Steiner Tree Problem
|
---|---|
Chapter number | 20 |
Book title |
Graph-Theoretic Concepts in Computer Science
|
Published by |
Springer Berlin Heidelberg, June 2001
|
DOI | 10.1007/3-540-45477-2_20 |
Book ISBNs |
978-3-54-042707-0, 978-3-54-045477-9
|
Authors |
Clemens Gröpl, Stefan Hougardy, Till Nierhoff, Hans Jürgen Prömel, Gröpl, Clemens, Hougardy, Stefan, Nierhoff, Till, Prömel, Hans Jürgen |
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 % |
---|---|---|
Slovenia | 1 | 17% |
Unknown | 5 | 83% |
Demographic breakdown
Readers by professional status | Count | As % |
---|---|---|
Student > Ph. D. Student | 3 | 50% |
Student > Postgraduate | 2 | 33% |
Professor > Associate Professor | 2 | 33% |
Professor | 1 | 17% |
Lecturer | 1 | 17% |
Other | 0 | 0% |
Readers by discipline | Count | As % |
---|---|---|
Mathematics | 4 | 67% |
Computer Science | 4 | 67% |
Agricultural and Biological Sciences | 1 | 17% |