Candidate selection algorithms in opportunistic routing.

Amir Darehshoorzadeh Llorenç Cerdà-Alabern

Published in: PM2HW2N@MSWiM (2010)

Keyphrases

computational cost
graph theory
computational complexity
significant improvement
computationally efficient
theoretical analysis
machine learning algorithms
computational efficiency
times faster
machine learning
computationally expensive
combinatorial optimization