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 |
New Inapproximability Bounds for TSP
|
---|---|
Chapter number | 53 |
Book title |
Algorithms and Computation
|
Published by |
Springer, Berlin, Heidelberg, December 2013
|
DOI | 10.1007/978-3-642-45030-3_53 |
Book ISBNs |
978-3-64-245029-7, 978-3-64-245030-3
|
Authors |
Marek Karpinski, Michael Lampis, Richard Schmied, Karpinski, Marek, Lampis, Michael, Schmied, Richard |
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 % |
---|---|---|
Russia | 1 | 33% |
France | 1 | 33% |
Unknown | 1 | 33% |
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 | 3 | 100% |