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 New Lower Bound for Classic Online Bin Packing
|
|---|---|
| Chapter number | 2 |
| Book title |
Approximation and Online Algorithms
|
| Published by |
Springer, Cham, September 2019
|
| DOI | 10.1007/978-3-030-39479-0_2 |
| Book ISBNs |
978-3-03-039478-3, 978-3-03-039479-0
|
| Authors |
János Balogh, József Békési, György Dósa, Leah Epstein, Asaf Levin, Balogh, János, Békési, József, Dósa, György, Epstein, Leah, Levin, Asaf |
Mendeley readers
The data shown below were compiled from readership statistics for 2 Mendeley readers of this research output. Click here to see the associated Mendeley record.
Geographical breakdown
| Country | Count | As % |
|---|---|---|
| Unknown | 2 | 100% |
Demographic breakdown
| Readers by professional status | Count | As % |
|---|---|---|
| Student > Doctoral Student | 1 | 50% |
| Unknown | 1 | 50% |
| Readers by discipline | Count | As % |
|---|---|---|
| Computer Science | 1 | 50% |
| Unknown | 1 | 50% |