New hardness results for routing on disjoint paths.
Julia ChuzhoyDavid H. K. KimRachit NimavatPublished in: STOC (2017)
Keyphrases
- disjoint paths
- approximation algorithms
- np hard
- computational complexity
- routing algorithm
- directed graph
- routing problem
- routing protocol
- phase transition
- np hardness
- undirected graph
- ad hoc networks
- np complete
- network topology
- neural network
- learning theory
- information theoretic
- worst case
- inter domain
- data sets
- social networks
- response time
- network topologies
- qos routing