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 |
Improved Inapproximability for TSP
|
|---|---|
| Chapter number | 21 |
| 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_21 |
| Book ISBNs |
978-3-64-232511-3, 978-3-64-232512-0
|
| Authors |
Michael Lampis, Lampis, Michael |
Mendeley readers
The data shown below were compiled from readership statistics for 5 Mendeley readers of this research output. Click here to see the associated Mendeley record.
Geographical breakdown
| Country | Count | As % |
|---|---|---|
| Unknown | 5 | 100% |
Demographic breakdown
| Readers by professional status | Count | As % |
|---|---|---|
| Professor | 1 | 20% |
| Student > Ph. D. Student | 1 | 20% |
| Unknown | 3 | 60% |
| Readers by discipline | Count | As % |
|---|---|---|
| Computer Science | 1 | 20% |
| Engineering | 1 | 20% |
| Unknown | 3 | 60% |