Half-Duplex Routing is NP-hard.
Yahya H. EzzeldinMartina CardoneChristina FragouliDaniela TuninettiPublished in: CoRR (2017)
Keyphrases
- np hard
- special case
- routing problem
- np complete
- routing algorithm
- scheduling problem
- optimal solution
- lower bound
- approximation algorithms
- routing protocol
- network topology
- worst case
- ad hoc networks
- remains np hard
- np hardness
- integer programming
- linear programming
- decision problems
- closely related
- shortest path
- vehicle routing problem
- computational complexity
- inter domain
- response time
- learning algorithm
- ant algorithm
- routing decisions
- wireless ad hoc networks
- service requirements
- knapsack problem
- maximum weight
- traffic engineering
- computationally hard
- set cover
- greedy heuristic
- minimum cost
- real time
- neural network
- data sets