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 |
Complexity of the Min-Max (Regret) Versions of Cut Problems
|
---|---|
Chapter number | 79 |
Book title |
Algorithms and Computation
|
Published by |
Springer, Berlin, Heidelberg, December 2005
|
DOI | 10.1007/11602613_79 |
Book ISBNs |
978-3-54-030935-2, 978-3-54-032426-3
|
Authors |
Hassene Aissi, Cristina Bazgan, Daniel Vanderpooten, Aissi, Hassene, Bazgan, Cristina, Vanderpooten, Daniel |
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 % |
---|---|---|
France | 1 | 100% |
Demographic breakdown
Readers by professional status | Count | As % |
---|---|---|
Professor > Associate Professor | 1 | 100% |
Readers by discipline | Count | As % |
---|---|---|
Business, Management and Accounting | 1 | 100% |