2-local 5/4-competitive algorithm for multicoloring triangle-free hexagonal graphs

Information Processing Letters

Volumn 90, Issue 5, 2004, Pages 239-246

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

^a UNIVERSITY OF MARIBOR   (Slovenia)

^b INSTITUTE OF MATHEMATICS   (Slovenia)

Author keywords

2 local distributed algorithms; Approximation algorithms; Cellular networks; Frequency planning; Graph algorithms; Graph coloring

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; CELLULAR TELEPHONE SYSTEMS; COMPUTATIONAL COMPLEXITY; GRAPH THEORY; THEOREM PROVING;

2-LOCAL DISTRIBUTED ALGORITHMS; APPROXIMATION ALGORITHMS; FREQUENCY PLANNING; GRAPH ALGORITHMS; GRAPH COLORING;

TELECOMMUNICATION NETWORKS;

EID: 2142723545     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2004.02.017     Document Type: Article

References (11)

1. Hale W.K. Frequency assignment. Proc. IEEE. 68:1980;1497-1514.
2. Havet F. Channel assignment and multicoloring of the induced subgraphs of the triangular lattice. Discrete Math. 233:2001;219-231.
3. Havet F., Žerovnik J. Finding a five bicoloring of a triangle-free subgraph of the triangular lattice. Discrete Math. 244:2002;103-108.
4. Janssen J., Krizanc D., Narayanan L., Shende S. Distributed online frequency assignment in cellular networks. J. Algorithms. 36:2000;119-151.
5. McDiarmid C., Reed B. Channel assignment and weighted coloring. Networks. 36:2000;114-117.
6. Narayanan L., Shende S. Static frequency assignment in cellular networks. Algorithmica. 29:2001;396-410. Earlier version in Sirocco 97 Krizanc D., Widmayer P. Proceedings of the 4th International Colloqium on Structural Information and Communication Complexity, Ascona, Switzerland. 1997;215-227 Carleton Scientific.
7. Narayanan L., Shende S. Static frequency assignment in cellular networks. Algorithmica. 29:2001;396-410. Earlier version in Sirocco 97 Krizanc D., Widmayer P. Proceedings of the 4th International Colloqium on Structural Information and Communication Complexity, Ascona, Switzerland. 1997;215-227 Carleton Scientific.
8. Narayanan L., Shende S. Corrigendum to static frequency assignment in cellular networks. Algorithmica. 32:2002;697.
9. Šparl P., Ubeda S., Žerovnik J. Upper bounds for the span of frequency plans in cellular networks. Internat. J. Appl. Math. 9:(2):2002;115-139.
10. Šparl, J. Žerovnik, 2-local 4/3-competitive algorithm for multicoloring hexagonal graphs, submitted for publication.
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.