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 |
Constraint Satisfaction Problems, and Relaxing Them Semidefinitely
|
|---|---|
| Chapter number | 12 |
| Book title |
Approximation Algorithms and Semidefinite Programming
|
| Published by |
Springer, Berlin, Heidelberg, January 2012
|
| DOI | 10.1007/978-3-642-22015-9_12 |
| Book ISBNs |
978-3-64-222014-2, 978-3-64-222015-9
|
| Authors |
Bernd Gärtner, Jiří Matoušek, Gärtner, Bernd, Matoušek, Jiří |
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 % |
|---|---|---|
| Australia | 1 | 50% |
| Unknown | 1 | 50% |
Demographic breakdown
| Readers by professional status | Count | As % |
|---|---|---|
| Student > Ph. D. Student | 1 | 50% |
| Lecturer | 1 | 50% |
| Readers by discipline | Count | As % |
|---|---|---|
| Mathematics | 2 | 100% |