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 |
Faster Algorithms for MAX CUT and MAX CSP , with Polynomial Expected Time for Sparse Instances
|
---|---|
Chapter number | 32 |
Book title |
Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques
|
Published by |
Springer, Berlin, Heidelberg, January 2003
|
DOI | 10.1007/978-3-540-45198-3_32 |
Book ISBNs |
978-3-54-040770-6, 978-3-54-045198-3
|
Authors |
Alexander D. Scott, Gregory B. Sorkin, Scott, Alexander D., Sorkin, Gregory B. |
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 % |
---|---|---|
France | 1 | 33% |
Unknown | 2 | 67% |
Demographic breakdown
Readers by professional status | Count | As % |
---|---|---|
Professor > Associate Professor | 1 | 33% |
Lecturer | 1 | 33% |
Student > Master | 1 | 33% |
Readers by discipline | Count | As % |
---|---|---|
Mathematics | 1 | 33% |
Computer Science | 1 | 33% |
Agricultural and Biological Sciences | 1 | 33% |