New Hardness Results for Routing on Disjoint Paths.
Julia ChuzhoyDavid H. K. KimRachit NimavatPublished in: SIAM J. Comput. (2022)
Keyphrases
- disjoint paths
- approximation algorithms
- routing algorithm
- np hardness
- np hard
- directed graph
- network topology
- learning theory
- ad hoc networks
- routing problem
- phase transition
- np complete
- routing protocol
- wireless ad hoc networks
- shortest path
- undirected graph
- image processing
- end to end
- wireless sensor networks
- uniform distribution
- mobile ad hoc networks
- special case
- agnostic learning
- inter domain
- qos routing
- computational complexity