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 |
Approximating Minimum-Cost Connected T -Joins
|
---|---|
Chapter number | 10 |
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_10 |
Book ISBNs |
978-3-64-232511-3, 978-3-64-232512-0
|
Authors |
Joseph Cheriyan, Zachary Friggstad, Zhihan Gao, Cheriyan, Joseph, Friggstad, Zachary, Gao, Zhihan |
Mendeley readers
The data shown below were compiled from readership statistics for 1 Mendeley reader of this research output. Click here to see the associated Mendeley record.
Geographical breakdown
Country | Count | As % |
---|---|---|
Unknown | 1 | 100% |
Demographic breakdown
Readers by professional status | Count | As % |
---|---|---|
Other | 1 | 100% |
Readers by discipline | Count | As % |
---|---|---|
Mathematics | 1 | 100% |