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.
Complexity Analyses of Bienstock–Zuckerberg and Lasserre Relaxations on the Matching and Stable Set Polytopes
Integer Programming and Combinatoral Optimization
Springer, Berlin, Heidelberg, June 2011
Yu Hin Au, Levent Tunçel
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.
|Readers by professional status||Count||As %|
|Student > Ph. D. Student||1||33%|
|Professor > Associate Professor||1||33%|
|Readers by discipline||Count||As %|