Login / Signup

A Dynamic Combined Flow Algorithm for the Two-Commodity Max-Flow Problem Over Delay-Tolerant Networks.

Tao ZhangHongyan LiJiandong LiShun ZhangHaiying Shen
Published in: IEEE Trans. Wirel. Commun. (2018)
Keyphrases
  • max flow
  • min cost
  • social networks
  • np hard
  • dynamic programming
  • delay tolerant
  • optimal solution
  • computational complexity
  • segmentation algorithm
  • energy function