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 Pseudopolynomial Time O(logn)-Approximation Algorithm for Art Gallery Problems
|
---|---|
Chapter number | 15 |
Book title |
Algorithms and Data Structures
|
Published by |
Springer Berlin Heidelberg, August 2007
|
DOI | 10.1007/978-3-540-73951-7_15 |
Book ISBNs |
978-3-54-073948-7, 978-3-54-073951-7
|
Authors |
Ajay Deshpande, Taejung Kim, Erik D. Demaine, Sanjay E. Sarma, Deshpande, Ajay, Kim, Taejung, Demaine, Erik D., Sarma, Sanjay E. |
Editors |
Frank Dehne, Jörg-Rüdiger Sack, Norbert Zeh |
Mendeley readers
The data shown below were compiled from readership statistics for 11 Mendeley readers of this research output. Click here to see the associated Mendeley record.
Geographical breakdown
Country | Count | As % |
---|---|---|
Unknown | 11 | 100% |
Demographic breakdown
Readers by professional status | Count | As % |
---|---|---|
Student > Ph. D. Student | 4 | 36% |
Researcher | 2 | 18% |
Other | 1 | 9% |
Student > Doctoral Student | 1 | 9% |
Student > Master | 1 | 9% |
Other | 1 | 9% |
Unknown | 1 | 9% |
Readers by discipline | Count | As % |
---|---|---|
Computer Science | 7 | 64% |
Business, Management and Accounting | 1 | 9% |
Arts and Humanities | 1 | 9% |
Unknown | 2 | 18% |