Channel assignment and weighted coloring

Networks

Volumn 36, Issue 2, 2000, Pages 114-117

  McDiarmid, Colin ^a   Reed, Bruce ^b  

^a UNIVERSITY OF OXFORD   (United Kingdom)

^b CNRS   (France)

Author keywords

Approximation algorithm; Cellular communication system; Hexagonal cells; Radio channel assignment; Triangular lattice; Weighted coloring

Indexed keywords

EID: 0034259821     PISSN: 00283045     EISSN: None     Source Type: Journal    
DOI: 10.1002/1097-0037(200009)36:2<114::AID-NET6>3.0.CO;2-G     Document Type: Article

References (17)

1. [1] P. Baldi and E.C. Posner, Graph coloring bounds for cellular radio. Comput Math Appl 19 (1990), 91-97.
2. [2] A. Gamst, Some lower bounds for a class of frequency assignment problems, IEEE Trans Vehic Technol VT-35 (1986), 8-14.
3. [3] M.R. Garey and D.S. Johnson, Computers and intractability, Freeman, San Francisco, 1979.
4. [4] M.R. Garey, D.S. Johnson, and L. Stockmeyer, Some simplified NP-complete graph problems, Theor Comput Sci 1 (1976), 237-267.
5. [5] S. Gerke and C. McDiarmid, Graph imperfection, manuscript, 1999.
6. [6] S. Gerke and C. McDiarmid, Graph imperfection II, manuscript, 1999.
7. [7] J.R. Griggs and D. Der-Fen Liu, The channel assignment problem for mutually adjacent sites, J Combin Theory A 68 (1994), 169-183.
8. [8] M. Grötschel, L. Lovász, and A. Schrijver, Geometric algorithms and combinatorial optimization, Springer-Verlag, Berlin Heidelberg, 1988.
9. [9] W.K. Hale, Frequency assignment: Theory and applications, Proc IEEE 68 (1980), 1497-1514.
10. [10] S. Hurley and R.A. Leese (eds), Models and methods for radio channel assignment, Oxford University Press, Oxford, to appear.
11. [11] S. Jordan and E.J. Schwabe, Worst-case performance of cellular channel assignment policies, ACM J Wireless Networks 2 (1996), 265-275.
12. [12] S. Khanna and K. Kumaran, On wireless spectrum estimation and generalized graph coloring, Proc 9th Ann Symp on Discrete Algorithms (SODA), 1998, pp. 383-393.
13. [13] V.H. MacDonald, The cellular concept, Bell Syst Tech J 58 (1979), 15-41.
14. [14] C. McDiarmid, Graph imperfection and channel assignment, to appear as a chapter in B.A. Reed, Perfect Graphs, Wiley, Chichester.
15. [15] L. Narayanan and S. Shende, Static frequency assignment in cellular networks, Proc 4th Coll on Structural Information and Communications Complexity, July 1997.
16. [16] N. Schabanel, S. Ubéda, and J. ̌erovnik, Upper bounds for the span of triangular lattice graphs: Application to frequency planning for cellular networks, manuscript, 1999.
17. [17] J. van den Heuvel, R.A. Leese, and M.A. Shepherd, Graph labelling and radio channel assignment, J Graph Theory 29 (1998), 263-283.