Half-duplex routing is NP-hard.
Yahya H. EzzeldinMartina CardoneChristina FragouliDaniela TuninettiPublished in: Allerton (2017)
Keyphrases
- np hard
- approximation algorithms
- routing problem
- scheduling problem
- np complete
- special case
- routing protocol
- routing algorithm
- optimal solution
- branch and bound algorithm
- network topology
- shortest path
- worst case
- computational complexity
- constraint satisfaction problems
- linear programming
- greedy heuristic
- vehicle routing problem
- lower bound
- decision problems
- wireless ad hoc networks
- computationally hard
- integer programming
- minimum cost
- neural network
- genetic algorithm
- np hardness
- end to end
- closely related
- ad hoc networks
- response time
- computationally challenging
- polynomial time approximation
- qos routing