Better Bounds for Incremental Frequency Allocation in Bipartite Graphs

We study frequency allocation in wireless networks. A wireless network is modeled by an undirected graph, with vertices corresponding to cells. In each vertex we have a certain number of requests, and each of those requests must be assigned a different frequency. Edges represent conflicts between cells, meaning that frequencies in adjacent vertices must be different as well. The objective is to minimize the total number of used frequencies. In this paper, we prove nearly tight bounds on the asymptotic competitive ratio for bipartite

• Type: Journal
• Year: 2011
• Where: CORR
• Authors: Marek Chrobak, Lukasz Jez, Jiri Sgall
• Keywords: Asymptotic Competitive Ratio, CORR 2011, Education, Frequency Allocation, Wireless Network