Complexity results on labeled shortest path problems from wireless routing metrics.

Charles B. Ward Nathan M. Wiegand

Published in: Comput. Networks (2010)

Keyphrases

shortest path problem
shortest path
mobile ad hoc networks
combinatorial optimization problems
complexity measures
computational complexity
wireless communication
supervised learning
worst case
wireless networks
neural network
routing algorithm
power control