Better Bounds for Incremental Frequency Allocation in Bipartite Graphs

  • Marek Chrobak
  • Łukasz Jeż
  • Jiří Sgall
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6942)


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.

The offline version of the problem is known to be NP-hard. In the incremental version, requests for frequencies arrive over time and the algorithm is required to assign a frequency to a request as soon as it arrives. Competitive incremental algorithms have been studied for several classes of graphs. For paths, the optimal (asymptotic) ratio is known to be 4/3, while for hexagonal-cell graphs it is between 1.5 and 1.9126. For ξ-colorable graphs, the ratio of (ξ + 1)/2 can be achieved.

In this paper, we prove nearly tight bounds on the asymptotic competitive ratio for bipartite graphs, showing that it is between 1.428 and 1.433. This improves the previous lower bound of 4/3 and upper bound of 1.5. Our proofs are based on reducing the incremental problem to a purely combinatorial (equivalent) problem of constructing set families with certain intersection properties.


Wireless Network Bipartite Graph Chromatic Number Competitive Ratio Incremental Algorithm 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Aardal, K., van Hoesel, S.P.M., Koster, A.M.C.A., Mannino, C., Sassano, A.: Models and solution techniques for frequency assignment problems. 4OR: Quarterly Journal of the Belgian, French and Italian Operations Research Societies 1, 261–317 (2003)MathSciNetzbMATHGoogle Scholar
  2. 2.
    Chan, J.W.-T., Chin, F.Y.L., Ye, D., Zhang, Y.: Online frequency allocation in cellular networks. In: SPAA 2007, pp. 241–249 (2007)Google Scholar
  3. 3.
    Chan, J.W.-T., Chin, F.Y.L., Ye, D., Zhang, Y.: Absolute and asymptotic bounds for online frequency allocation in cellular networks. Algorithmica 58, 498–515 (2010)Google Scholar
  4. 4.
    Chan, J.W.-T., Chin, F.Y.L., Ye, D., Zhang, Y., Zhu, H.: Frequency allocation problems for linear cellular networks. In: Asano, T. (ed.) ISAAC 2006. LNCS, vol. 4288, pp. 61–70. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  5. 5.
    Chin, F.Y.L., Zhang, Y., Zhu, H.: A 1-Local 13/9-Competitive Algorithm for Multicoloring Hexagonal Graphs. In: Lin, G. (ed.) COCOON 2007. LNCS, vol. 4598, pp. 526–536. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  6. 6.
    Chrobak, M., Sgall, J.: Three results on frequency assignment in linear cellular networks. Theoretical Computer Science 411, 131–137 (2010)Google Scholar
  7. 7.
    McDiarmid, C., Reed, B.: Channel assignment and weighted colouring. Networks 36, 114–117 (2000)Google Scholar
  8. 8.
    Murphey, R.A., Pardalos, P.M., Resende, M.G.C.: Frequency assignment problems. In: Handbook of Combinatorial Optimization, pp. 295–377. Kluwer Academic Publishers, Dordrecht (1999)Google Scholar
  9. 9.
    Narayanan, L., Shende, S.M.: Static frequency assignment in cellular networks. Algorithmica 29, 396–409 (2001)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Marek Chrobak
    • 1
  • Łukasz Jeż
    • 2
  • Jiří Sgall
    • 3
  1. 1.Department of Computer ScienceUniv. of CaliforniaRiversideUSA
  2. 2.Institute of Computer ScienceUniversity of WrocławWrocławPoland
  3. 3.Dept. of Applied Mathematics, Faculty of Mathematics and PhysicsCharles UniversityPraha 1Czech Republic

Personalised recommendations