Minimum Cost Routing on Stochastic Networks.
Gehan A. CoreaVidyadhar G. KulkarniPublished in: Oper. Res. (1990)
Keyphrases
- minimum cost
- network flow
- np hard
- approximation algorithms
- network topologies
- network flow problem
- capacity constraints
- network simplex algorithm
- spanning tree
- routing algorithm
- network structure
- traffic engineering
- undirected graph
- minimum cost flow
- dynamic routing
- network design
- ad hoc networks
- link failure
- computer networks
- complex networks
- upper bound