A new lower bound for the frequency assignment problem

IEEE/ACM Transactions on Networking

Volumn 5, Issue 1, 1997, Pages 34-39

  Tcha, Dong Wan ^a,b   Chung, Yong Joo ^b   Choi, Taek Jin ^b  

^a Korea Advanced Institute of Science and Technology ^*

^b Korea Advanced Institute of Science and Technology (KAIST)   (South Korea)

Author keywords

[No Author keywords available]

Indexed keywords

FREQUENCY ALLOCATION; FREQUENCY STANDARDS; PROBLEM SOLVING;

FREQUENCY ASSIGNMENT PROBLEM (FAP);

CELLULAR TELEPHONE SYSTEMS;

EID: 0031079526     PISSN: 10636692     EISSN: None     Source Type: Journal    
DOI: 10.1109/90.554720     Document Type: Article

References (10)

1. W. K. Hale, "Frequency assignment: Theory and applications," Proc. IEEE, vol. 68, no. 12, pp. 1497-1514, 1980.
2. F. Box, "A heuristic technique for assigning frequencies to mobile radio nets," IEEE Trans. Veh. Technol., vol. VT-27, no. 2, pp. 57-64, 1978.
3. J. A. Zoellner and C. L. Beall, " A breakthrough in spectrum conserving frequency assignment technology," IEEE Trans. Electromag. Compat., vol. EMC-19, no. 3, pp. 313-319, 1977.
4. M. R. Garey and D. S. Johnson, "The complexity of near-optimal graph coloring," J. ACM, vol. 23, pp. 43-49, 1976.
5. R. D. Dutton and R. C. Brigham, "A new graph coloring algorithm," Computer J., vol. 24, no. 1, pp. 85-86, 1981.
6. A. Gamst and W. Rave, "On the frequency assignment in mobile automatic telephone systems," in Proc. GLOBECOM'82, IEEE, 1982.
7. A. Gamst, "Some lower bounds for a class of frequency assignment problems," IEEE Trans. Veh. Technol., vol. VT-35, no. 1, pp. 8-14, 1986.
8. C. Bron and J. Kerbosch, "Finding all cliques of an undirected graph (Algorithm 457)," Commun. ACM, vol. 16, no. 9, pp. 575-577, 1973.
9. K. N. Sivarajan, R. J. McEliece, and J. K. Ketchum, "Channel assignment in cellular radio," in 39th IEEE VTC, 1989.
10. K. Raith and J. Uddenfeldt, "Capacity of digital TDMA systems," IEEE Trans. Veh. Technol., vol. 40, no. 2, 1991.