Login / Signup
Algorithms for limited-buffer shortest path problems in communication-restricted environments.
Alessandro Riva
Arlind Rufi
Jacopo Banfi
Francesco Amigoni
Published in:
Robotics Auton. Syst. (2019)
Keyphrases
</>
computational complexity
shortest path problem
computational cost
theoretical analysis
times faster
data structure
search algorithm
computationally efficient
combinatorial optimization problems
email
special case
optimization problems
benchmark datasets
search strategies
communication bandwidth