New Hardness Results for Routing on Disjoint Paths.
Julia ChuzhoyDavid H. K. KimRachit NimavatPublished in: CoRR (2016)
Keyphrases
- disjoint paths
- approximation algorithms
- directed graph
- np hard
- routing algorithm
- routing protocol
- np hardness
- routing problem
- ad hoc networks
- qos routing
- network topology
- worst case
- undirected graph
- inter domain
- information theoretic
- shortest path
- phase transition
- computational complexity
- traffic engineering
- mobile ad hoc networks
- bayesian networks