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 |
Improved Minmax Regret 1-Center Algorithms for Cactus Networks with c Cycles
|
---|---|
Chapter number | 29 |
Book title |
LATIN 2014: Theoretical Informatics
|
Published by |
Springer, Berlin, Heidelberg, March 2014
|
DOI | 10.1007/978-3-642-54423-1_29 |
Book ISBNs |
978-3-64-254422-4, 978-3-64-254423-1
|
Authors |
Binay Bhattacharya, Tsunehiko Kameda, Zhao Song, Bhattacharya, Binay, Kameda, Tsunehiko, Song, Zhao |
Mendeley readers
The data shown below were compiled from readership statistics for 16 Mendeley readers of this research output. Click here to see the associated Mendeley record.
Geographical breakdown
Country | Count | As % |
---|---|---|
Brazil | 1 | 6% |
Unknown | 15 | 94% |
Demographic breakdown
Readers by professional status | Count | As % |
---|---|---|
Student > Ph. D. Student | 5 | 31% |
Student > Master | 3 | 19% |
Professor | 2 | 13% |
Researcher | 2 | 13% |
Lecturer | 1 | 6% |
Other | 1 | 6% |
Unknown | 2 | 13% |
Readers by discipline | Count | As % |
---|---|---|
Computer Science | 12 | 75% |
Business, Management and Accounting | 1 | 6% |
Physics and Astronomy | 1 | 6% |
Unknown | 2 | 13% |