Minimum-Cost Crowdsourcing with Coverage Guarantee in Mobile Opportunistic D2D Networks.
Yanyan HanHongyi WuPublished in: IEEE Trans. Mob. Comput. (2017)
Keyphrases
- minimum cost
- np hard
- approximation algorithms
- network flow
- network flow problem
- spanning tree
- mobile devices
- network simplex algorithm
- complex networks
- capacity constraints
- social networks
- multimedia services
- network structure
- image registration
- undirected graph
- mobile users
- weighted sum
- mobile networks
- special case
- minimum cost flow