On the Computational Complexity of Continuous Routing.
Yukon ChangSusanne E. HambruschJanos SimonPublished in: J. Algorithms (1989)
Keyphrases
- computational complexity
- special case
- routing algorithm
- np complete
- network topology
- low complexity
- computational efficiency
- ad hoc networks
- high computational complexity
- shortest path
- decision problems
- wireless ad hoc networks
- routing problem
- qos routing
- ant algorithm
- network topologies
- storage requirements
- memory requirements
- rate distortion
- computational cost
- np hard