Premium
Beware greedy algorithms
Author(s) -
Simmons Benno I.,
Hoeppke Christoph,
Sutherland William J.
Publication year - 2019
Publication title -
journal of animal ecology
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 2.134
H-Index - 157
eISSN - 1365-2656
pISSN - 0021-8790
DOI - 10.1111/1365-2656.12963
Subject(s) - greedy algorithm , computer science , algorithm
To fairly compare the nestedness of ecological networks, a network's observed nestedness can be divided by its maximum nestedness. The authors show that a greedy algorithm does not find networks’ maximum nestedness values. Simulated annealing achieved much better results, laying the foundation for future development of even more sophisticated algorithms.