New lower bounds for oblivious routing in undirected graphs.
Mohammad Taghi HajiaghayiRobert D. KleinbergFrank Thomson LeightonHarald RäckePublished in: SODA (2006)
Keyphrases
- undirected graph
- lower bound
- routing problem
- upper bound
- multicommodity flow
- approximation algorithms
- directed graph
- minimum cost
- np hard
- directed acyclic graph
- complex networks
- routing algorithm
- spanning tree
- worst case
- connected components
- graph structure
- upper and lower bounds
- objective function
- random graphs
- disjoint paths
- optimal solution
- routing protocol
- lower and upper bounds
- shortest path
- data streams
- strongly connected