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 |
A network-flow technique for finding low-weight bounded-degree spanning trees
|
---|---|
Chapter number | 9 |
Book title |
Integer Programming and Combinatorial Optimization
|
Published by |
Springer, Berlin, Heidelberg, June 1996
|
DOI | 10.1007/3-540-61310-2_9 |
Book ISBNs |
978-3-54-061310-7, 978-3-54-068453-4
|
Authors |
Sándor P. Fekete, Samir Khuller, Monika Klemmstein, Balaji Raghavachari, Neal Young, Fekete, Sándor P., Khuller, Samir, Klemmstein, Monika, Raghavachari, Balaji, Young, Neal |
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 % |
---|---|---|
Spain | 1 | 8% |
Germany | 1 | 8% |
Canada | 1 | 8% |
Unknown | 9 | 75% |
Demographic breakdown
Readers by professional status | Count | As % |
---|---|---|
Student > Ph. D. Student | 4 | 33% |
Professor > Associate Professor | 2 | 17% |
Researcher | 2 | 17% |
Student > Master | 1 | 8% |
Unknown | 3 | 25% |
Readers by discipline | Count | As % |
---|---|---|
Computer Science | 6 | 50% |
Business, Management and Accounting | 1 | 8% |
Mathematics | 1 | 8% |
Unknown | 4 | 33% |