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 |
An Asymptotic $$ \mathcal{O} $$ (ln ρ/ ln ln ρ)-Approximation Algorithm for the Scheduling Problem with Duplication on Large Communication Delay Graphs
|
---|---|
Chapter number | 12 |
Book title |
STACS 2002
|
Published by |
Springer, Berlin, Heidelberg, March 2002
|
DOI | 10.1007/3-540-45841-7_12 |
Book ISBNs |
978-3-54-043283-8, 978-3-54-045841-8
|
Authors |
R. Lepere, C. Rapine, Lepere, R., Rapine, C. |
Mendeley readers
The data shown below were compiled from readership statistics for 5 Mendeley readers of this research output. Click here to see the associated Mendeley record.
Geographical breakdown
Country | Count | As % |
---|---|---|
Unknown | 5 | 100% |
Demographic breakdown
Readers by professional status | Count | As % |
---|---|---|
Professor | 2 | 40% |
Professor > Associate Professor | 1 | 20% |
Student > Master | 1 | 20% |
Unknown | 1 | 20% |
Readers by discipline | Count | As % |
---|---|---|
Environmental Science | 1 | 20% |
Computer Science | 1 | 20% |
Decision Sciences | 1 | 20% |
Unknown | 2 | 40% |