Two-segmented Channel Routing Is Strong NP-complete.
Wing Ning LiPublished in: Discret. Appl. Math. (1997)
Keyphrases
- np complete
- np hard
- randomly generated
- satisfiability problem
- multi channel
- computational complexity
- conjunctive queries
- bounded treewidth
- wireless channels
- routing problem
- ad hoc networks
- division multiple access
- routing algorithm
- multiple access
- routing protocol
- polynomial time complexity
- data model
- communication channels
- communication systems
- network topology
- data complexity
- channel coding
- inter domain
- switched networks
- quality of service
- response time
- transmission delay