Approximation algorithms for channel allocation problems in broadcast networks.
Rajiv GandhiSamir KhullerAravind SrinivasanNan WangPublished in: Networks (2006)
Keyphrases
- approximation algorithms
- allocation problems
- special case
- resource allocation
- np hard
- worst case
- vertex cover
- minimum cost
- cellular networks
- np hardness
- facility location problem
- approximation schemes
- primal dual
- constant factor approximation
- open shop
- randomized algorithms
- complex networks
- set cover
- network design problem
- approximation ratio
- network structure
- constant factor
- network design
- polynomial time approximation
- undirected graph
- upper bound
- disjoint paths
- scheduling problem
- combinatorial auctions