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]).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
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)
Sparl, P., Zerovnik, J.: 2-local 4/3-competitive Algorithm for Multicoloring Hexagonal Graphs. Journal of Algorithms 55(1), 29–41 (2005)
McDiarmid, C., Reed, B.: Channel assignment and weighted coloring. Networks 36(2), 114–117 (2000)
Sudeep, K.S., Vishwanathan, S.: A technique for multicoloring triangle-free hexagonal graphs. Discrete Mathematics 300, 256–259 (2005)
Narayanan, L.: Channel assignment and graph multicoloring. In: Handbook of wireless networks and mobile computing, pp. 71–94. Wiley, New York (2002)
Narayanan, L., Shende, S.M.: Static frequency assignment in cellular networks. Algorithmica 29(3), 396–409 (2001)
Hale, W.K.: Frequency assignment: theory and applications. Proceedings of the IEEE 68(12), 1497–1514 (1980)
Janssen, J., Krizanc, D., Narayanan, L., Shende, S.: Distributed Online Frequency Assignment in Cellular Network. Journal of Algorithms 36(2), 119–151 (2000)
Havet, F.: Channel assignment and multicoloring of the induced subgraphs of the triangular lattice. Discrete Mathematics 233, 219–231 (2001)
Sparl, P., Zerovnik, J.: 2-local 5/4-competitive algorithm for multicoloring triangle-free hexagonal graphs. Information Processing Letters 90(5), 239–246 (2004)
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)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Witkowski, R. (2009). 1-Local 17/12-Competitive Algorithm for Multicoloring Hexagonal Graphs. In: Kutyłowski, M., Charatonik, W., Gębala, M. (eds) Fundamentals of Computation Theory. FCT 2009. Lecture Notes in Computer Science, vol 5699. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03409-1_31
Download citation
DOI: https://doi.org/10.1007/978-3-642-03409-1_31
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-03408-4
Online ISBN: 978-3-642-03409-1
eBook Packages: Computer ScienceComputer Science (R0)