Dogleg Channel Routing is NP-Complete.
Thomas G. SzymanskiPublished in: IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. (1985)
Keyphrases
- np complete
- np hard
- randomly generated
- multi channel
- computational complexity
- division multiple access
- routing problem
- routing algorithm
- network topology
- pspace complete
- satisfiability problem
- bounded treewidth
- polynomial time complexity
- phase transition
- switched networks
- np complete problems
- shortest path
- routing protocol
- data complexity
- multiple access
- inter domain
- scheduling problem
- ad hoc networks
- transmission delay
- conp complete
- fading channels
- wireless ad hoc networks
- end to end