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.
Speeding up Approximation Algorithms for NP-Hard Spanning Forest Problems by Multi-objective Optimization
LATIN 2006: Theoretical Informatics
Lecture notes in computer science, January 2006
Neumann, Frank, Laumanns, Marco, Frank Neumann, Marco Laumanns
The data shown below were compiled from readership statistics for 18 Mendeley readers of this research output. Click here to see the associated Mendeley record.
|Readers by professional status||Count||As %|
|Student > Ph. D. Student||6||33%|
|Student > Master||3||17%|
|Lecturer > Senior Lecturer||1||6%|
|Readers by discipline||Count||As %|