2-local 4/3-competitive algorithm for multicoloring hexagonal graphs

Journal of Algorithms

Volumn 55, Issue 1, 2005, Pages 29-41

  Šparl, Petra ^a,b   Žerovnik, Janez ^a,b  

^a UNIVERSITY OF MARIBOR   (Slovenia)

^b INSTITUTE OF MATHEMATICS   (Slovenia)

Author keywords

2 local distributed algorithm; Cellular networks; Frequency planning; Graph coloring

Indexed keywords

ALGORITHMS; COMPUTATION THEORY; FREQUENCIES; OPTIMIZATION; PROBLEM SOLVING; TRANSMITTERS;

2-LOCAL DISTRIBUTED ALGORITHMS; CELLULAR NETWORKS; FREQUENCY PLANNING; GRAPH COLORING;

GRAPH THEORY;

EID: 14844346155     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jalgor.2004.09.001     Document Type: Article

References (11)

1. W.K. Hale Frequency assignment Proceedings of the IEEE 68 1980 1497 1514
2. F. Havet Channel assignment and multicoloring of the induced subgraphs of the triangular lattice Discrete Math. 233 2001 219 231
3. F. Havet, and J. Žerovnik Finding a five bicolouring of a triangle-free subgraph of the triangular lattice Discrete Math. 244 2002 103 108
4. J. Janssen, D. Krizanc, L. Narayanan, and S. Shende Distributed online frequency assignment in cellular networks J. Algorithms 36 2000 119 151
5. C. McDiarmid, and B. Reed Channel assignment and weighted coloring Networks Suppl. 36 2000 114 117
6. L. Narayanan, and S. Shende Static frequency assignment in cellular networks Algorithmica 29 2001 396 410 earlier version D. Krizanc P. Widmayer Sirocco 97, Proceedings of the 4th International Colloqium on Structural Information and Communication Complexity Ascona, Switzerland 1997 Carleton Scientific 215 227
7. L. Narayanan, and S. Shende Static frequency assignment in cellular networks Algorithmica 29 2001 396 410 earlier version D. Krizanc P. Widmayer Sirocco 97, Proceedings of the 4th International Colloqium on Structural Information and Communication Complexity Ascona, Switzerland 1997 Carleton Scientific 215 227
8. L. Narayanan, and S. Shende Corrigendum to static frequency assignment in cellular networks Algorithmica 32 2002 697
9. P. Šparl, and J. Žerovnik 2-local 5 / 4 -competitive algorithm for multicoloring triangle-free hexagonal graphs Inform. Process. Lett. 90 2004 239 246
10. P. Šparl, S. Ubeda, and J. Žerovnik Upper bounds for the span of frequency plans in cellular networks Int. J. Pure Appl. Math. 9 2 2002 115 139
11. S. Ubeda, J. Žerovnik, Upper bounds for the span of triangular lattice graphs: application to frequency planing for cellular networks, Research report No. 97-28, ENS Lyon, September 1997