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 |
The complexity of approximating the class Steiner tree problem
|
---|---|
Chapter number | 8 |
Book title |
Graph-Theoretic Concepts in Computer Science
|
Published by |
Springer, Berlin, Heidelberg, June 1991
|
DOI | 10.1007/3-540-55121-2_8 |
Book ISBNs |
978-3-54-055121-8, 978-3-54-046735-9
|
Authors |
Edmund Ihler, Ihler, Edmund |
Mendeley readers
The data shown below were compiled from readership statistics for 12 Mendeley readers of this research output. Click here to see the associated Mendeley record.
Geographical breakdown
Country | Count | As % |
---|---|---|
Unknown | 12 | 100% |
Demographic breakdown
Readers by professional status | Count | As % |
---|---|---|
Student > Ph. D. Student | 3 | 25% |
Professor | 2 | 17% |
Researcher | 2 | 17% |
Lecturer | 1 | 8% |
Professor > Associate Professor | 1 | 8% |
Other | 0 | 0% |
Unknown | 3 | 25% |
Readers by discipline | Count | As % |
---|---|---|
Computer Science | 4 | 33% |
Agricultural and Biological Sciences | 1 | 8% |
Mathematics | 1 | 8% |
Physics and Astronomy | 1 | 8% |
Engineering | 1 | 8% |
Other | 0 | 0% |
Unknown | 4 | 33% |