The k-Constrained Bipartite Matching Problem: Approximation Algorithms and Applications to Wireless Networks.
André BergerJames GrossTobias HarksPublished in: INFOCOM (2010)
Keyphrases
- wireless networks
- approximation algorithms
- bipartite matching
- np hard
- minimum cost
- minimum cost flow
- maximum weight
- special case
- wireless communication
- worst case
- vertex cover
- approximation ratio
- primal dual
- constant factor
- wired networks
- ad hoc networks
- multimedia services
- spanning tree
- linear programming
- optimal solution