Oblivious routing on node-capacitated and directed graphs.
Mohammad Taghi HajiaghayiRobert D. KleinbergHarald RäckeTom LeightonPublished in: ACM Trans. Algorithms (2007)
Keyphrases
- directed graph
- routing problem
- source node
- random walk
- graph structure
- single source
- routing algorithm
- destination node
- strongly connected
- maximum flow
- shortest path problem
- vehicle routing problem
- np hard
- undirected graph
- lot sizing
- directed acyclic graph
- routing protocol
- network topology
- bayesian networks
- graph structures
- facility location
- shortest path
- probability distribution
- disjoint paths
- markov chain
- multi item
- mobile ad hoc networks
- network topologies
- level set
- dynamic programming
- inter domain
- multi source