Inapproximability of Edge-Disjoint Paths and low congestion routing on undirected graphs.
Matthew AndrewsJulia ChuzhoyVenkatesan GuruswamiSanjeev KhannaKunal TalwarLisa ZhangPublished in: Comb. (2010)
Keyphrases
- disjoint paths
- approximation algorithms
- undirected graph
- np hard
- dynamic routing
- packet transmission
- special case
- directed graph
- minimum cost
- worst case
- connected components
- complex networks
- routing decisions
- directed acyclic graph
- mobile ad hoc networks
- ad hoc networks
- routing problem
- spanning tree
- xml documents
- upper bound
- random graphs
- gray scale
- routing protocol
- packet loss
- network topology
- graph structure
- routing algorithm
- social network analysis