Max-Flow Min-Cost Routing in a Future-Internet with Improved QoS Guarantees.
Ted H. SzymanskiPublished in: IEEE Trans. Commun. (2013)
Keyphrases
- max flow
- min cost
- ad hoc networks
- network flow
- energy minimization
- convex programming
- quality of service
- graph cuts
- combinatorial optimization problems
- min cut
- convex relaxation
- phase unwrapping
- approximation algorithms
- routing algorithm
- web services
- ip networks
- parallel processors
- integer programming
- routing protocol
- energy function
- least squares