Proportional fairness in multi-carrier system: upper bound and approximation algorithms.
Megumi KanekoPetar PopovskiJoachim DahlPublished in: IEEE Commun. Lett. (2006)
Keyphrases
- approximation algorithms
- upper bound
- worst case
- constant factor
- lower bound
- np hard
- special case
- minimum cost
- vertex cover
- randomized algorithms
- primal dual
- network design problem
- branch and bound algorithm
- open shop
- branch and bound
- facility location problem
- greedy algorithm
- set cover
- approximation ratio
- exact algorithms
- single item
- lower and upper bounds
- error bounds
- approximation schemes
- precedence constraints
- convergence rate
- polynomial time approximation
- resource allocation
- combinatorial auctions