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 |
Approximation Algorithms for Maximum Coverage and Max Cut with Given Sizes of Parts
|
---|---|
Chapter number | 2 |
Book title |
Integer Programming and Combinatorial Optimization
|
Published by |
Springer, Berlin, Heidelberg, June 1999
|
DOI | 10.1007/3-540-48777-8_2 |
Book ISBNs |
978-3-54-066019-4, 978-3-54-048777-7
|
Authors |
Alexander A. Ageev, Maxim I. Sviridenko, Ageev, Alexander A., Sviridenko, Maxim I. |
Mendeley readers
The data shown below were compiled from readership statistics for 26 Mendeley readers of this research output. Click here to see the associated Mendeley record.
Geographical breakdown
Country | Count | As % |
---|---|---|
Hong Kong | 1 | 4% |
United States | 1 | 4% |
Russia | 1 | 4% |
Canada | 1 | 4% |
Unknown | 22 | 85% |
Demographic breakdown
Readers by professional status | Count | As % |
---|---|---|
Student > Ph. D. Student | 13 | 50% |
Student > Doctoral Student | 2 | 8% |
Researcher | 2 | 8% |
Student > Postgraduate | 2 | 8% |
Professor | 1 | 4% |
Other | 3 | 12% |
Unknown | 3 | 12% |
Readers by discipline | Count | As % |
---|---|---|
Computer Science | 17 | 65% |
Mathematics | 3 | 12% |
Engineering | 2 | 8% |
Business, Management and Accounting | 1 | 4% |
Unknown | 3 | 12% |