FCT 2009: Fundamentals of Computation Theory pp 346-356 | Cite as
1-Local 17/12-Competitive Algorithm for Multicoloring Hexagonal Graphs
Abstract
In the frequency allocation problem we are given a cellular telephone network whose geographical coverage area is divided into cells where phone calls are serviced by frequencies assigned to them, so that none of the pairs of calls emanating from the same or neighboring cells is assigned the same frequency. The problem is to use the frequencies efficiently, i.e. minimize the span of used frequencies. The frequency allocation problem can be regarded as a multicoloring problem on a weighted hexagonal graph. In this paper we present a 1-local 17/12-competitive distributed algorithm for a multicoloring of hexagonal graph, thereby improving the competitiveness ratio of previously known best 1-local 13/9-competitive algorithm (see [1]).
Keywords
Channel Assignment Triangular Lattice Frequency Assignment Base Color White VertexPreview
Unable to display preview. Download preview PDF.
References
- 1.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
- 2.Sparl, P., Zerovnik, J.: 2-local 4/3-competitive Algorithm for Multicoloring Hexagonal Graphs. Journal of Algorithms 55(1), 29–41 (2005)MathSciNetCrossRefMATHGoogle Scholar
- 3.McDiarmid, C., Reed, B.: Channel assignment and weighted coloring. Networks 36(2), 114–117 (2000)MathSciNetCrossRefMATHGoogle Scholar
- 4.Sudeep, K.S., Vishwanathan, S.: A technique for multicoloring triangle-free hexagonal graphs. Discrete Mathematics 300, 256–259 (2005)MathSciNetCrossRefMATHGoogle Scholar
- 5.Narayanan, L.: Channel assignment and graph multicoloring. In: Handbook of wireless networks and mobile computing, pp. 71–94. Wiley, New York (2002)CrossRefGoogle Scholar
- 6.Narayanan, L., Shende, S.M.: Static frequency assignment in cellular networks. Algorithmica 29(3), 396–409 (2001)MathSciNetCrossRefMATHGoogle Scholar
- 7.Hale, W.K.: Frequency assignment: theory and applications. Proceedings of the IEEE 68(12), 1497–1514 (1980)CrossRefGoogle Scholar
- 8.Janssen, J., Krizanc, D., Narayanan, L., Shende, S.: Distributed Online Frequency Assignment in Cellular Network. Journal of Algorithms 36(2), 119–151 (2000)MathSciNetCrossRefMATHGoogle Scholar
- 9.Havet, F.: Channel assignment and multicoloring of the induced subgraphs of the triangular lattice. Discrete Mathematics 233, 219–231 (2001)MathSciNetCrossRefMATHGoogle Scholar
- 10.Sparl, P., Zerovnik, J.: 2-local 5/4-competitive algorithm for multicoloring triangle-free hexagonal graphs. Information Processing Letters 90(5), 239–246 (2004)MathSciNetCrossRefMATHGoogle Scholar
- 11.Zerownik, J.: A distributed 6/5-competitive algorithm for multicoloring triangle-free hexagonal graphs. International Journal of Pure and Applied Mathematics 23(2), 141–156 (2005)MathSciNetGoogle Scholar