Minimum Cost Multicast with Decentralized Sources
Nebojsa MilosavljevicSameer PawarSalim Y. El RouayhebMichael GastparKannan RamchandranPublished in: CoRR (2012)
Keyphrases
- minimum cost
- np hard
- approximation algorithms
- network flow
- network flow problem
- spanning tree
- capacity constraints
- network simplex algorithm
- peer to peer
- edit operations
- overlay network
- data sources
- wireless networks
- routing algorithm
- minimum cost flow
- optimal solution
- distance function
- worst case
- scheduling problem
- dynamic programming
- multicast routing