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 |
The Projection Games Conjecture and the NP-Hardness of ln n -Approximating Set-Cover
|
---|---|
Chapter number | 24 |
Book title |
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
|
Published by |
Springer, Berlin, Heidelberg, January 2012
|
DOI | 10.1007/978-3-642-32512-0_24 |
Book ISBNs |
978-3-64-232511-3, 978-3-64-232512-0
|
Authors |
Dana Moshkovitz, Moshkovitz, Dana |
Mendeley readers
The data shown below were compiled from readership statistics for 3 Mendeley readers of this research output. Click here to see the associated Mendeley record.
Geographical breakdown
Country | Count | As % |
---|---|---|
Unknown | 3 | 100% |
Demographic breakdown
Readers by professional status | Count | As % |
---|---|---|
Student > Ph. D. Student | 2 | 67% |
Student > Master | 1 | 33% |
Readers by discipline | Count | As % |
---|---|---|
Computer Science | 1 | 33% |
Physics and Astronomy | 1 | 33% |
Engineering | 1 | 33% |