Exact solution of a class of frequency assignment problems in cellular networks: (Extended abstract)

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2841, Issue , 2003, Pages 163-173

  Calamoneri, Tiziana ^a  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

Cellular graphs; Frequency assignment problem; L(h, k) labeling; Multihop radio networks

Indexed keywords

COMBINATORIAL OPTIMIZATION; FREQUENCY ALLOCATION; TRANSMITTERS;

CELLULAR GRAPHS; CELLULAR NETWORK; EXACT SOLUTION; EXTENDED ABSTRACTS; FREQUENCY ASSIGNMENT PROBLEM; L(H , K)-LABELING; MULTI-HOP RADIO NETWORKS;

RADIO TRANSMISSION;

EID: 0142249888     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45208-9_14     Document Type: Article

References (23)

1. K.I. Aardal, S.P.M. van Hoesel, A.M.C.A. Koster, C. Mannino and A. Sassano. Models and Solution Techniques for frequency Assignment Problems. ZIB-Report 01-40, Konrad-Zuse-Zentrum fur Informationstechnik Berlin, 2001.
2. A.A. Bertossi and M.A. Bonuccelli. Code Assignment for Hidden Terminal Interference Avoidance in Multihop Packet Radio Networks. IEEE/ACM Trans. on Networking, 3:441-449, 1995.
3. A.A. Bertossi, C.M. Pinotti and R.B. Tan: Channel assignment with separation for interference avoidance in wireless networks. IEEE Transactions on Parallel and Distributed Systems (in press).
4. Preliminary version in ACM Workshop DIAL M 2000, 2000.
5. H.L. Bodlaender, T. Kloks, R.B. Tan and J. van Leeuwen. λ-Coloring of Graphs. In Proc. of STACS 2000, pages 395-406. Lectures Notes in Computer Science 1770, 2000.
6. T. Calamoneri and R. Petreschi: L(2, 1)-Labeling of Planar Graphs (Extended Abstract). In Proceedings of 5th ACM Int. Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DIAL M), 2001, pages 28-33.
7. T. Calamoneri and R. Petreschi: On the Radiocoloring Problem. In Proceedings of 4th Int.l Workshop on Distributed Computing (IWDC, Lecture Notes in Computer Science 2571, 2002, pages 118-127.
8. T. Calamoneri and R. Petreschi: λ-Coloring Unigraphs. In Proceedings of LATIN 2002. Lectures Notes in Computer Science Science 2286, pp. 236-247, 2002.
9. T. Calamoneri, A. Pelc and R. Petreschi. Labeling trees with a condition at distance two. In Proceedings of R. C. Bose Centenary Symp. on Discr. Math. and Applications; electronic notes in discrete mathemathics, 2002.
10. T. Calamoneri and P. Vocca: On the Approximability of the L(h, k)-Labelling Problem. Manuscript, 2003.
11. G.J. Chang and D. Kuo. The L(2, 1)-labeling Problem on Graphs. SIAM J. Disc. Math., 9:309-316, 1996.
12. D.A. Fotakis, S.E. Nikoletseas, V.G. Papadoulou and P.G. Spirakis: NP-completeness Results and Efficient Approximations for Radiocoloring in Planar Graphs. In Proceedings of 25th Int.l Symp. on Math. Foundations of Compu. Sci. (MFCS 2000), 2000.
13. j-numbers of the products of complete graphs, Congr. Numer. 140 (1999), 141-160.
14. J.P. Georges, D.W. Mauro and M.I. Stein, Labeling products of complete graphs with a condition at distance two, SIAM J. Discr. Math. 14 (2000), 28-35.
15. J.R. Griggs and R.K. Yeh. Labeling graphs with a Condition at Distance 2. SIAM J. Disc. Math, 5:586-595, 1992.
16. J. van den Heuvel, R.A. Leese and M.A. Shepherd: Graph Labelling and Radio Channel Assignment. Journal of Graph Theory 29 (1998): 263-283.
17. A.M.C.A. Koster. Frequency Assignment. Ph.D. thesis, Universiteit Maastricht, 1999.
18. D. Liu and R.K. Yeh, On distance two labelings of graphs, Ars Combinatoria 47 (1997), 13-22.
19. M. Molloy and M.R. Salavatipour. Frequency channel assignment on planar networks. In Proceedings of 10th Annual European Symposium on Algorithms (ESA) 2002, pp 736-747.
20. R.A. Murphey, P.M. Pardalos and M.G.C. Resende. Frequency Assignment Problems. In Handbook of Combinatorial Optimization, D.-Z. Du and P.M. Pardalos (Eds.) :295-377, 1999. Kluweker Academic Publishers.
21. D. Sakai. Labeling Chordal Graphs: Distance Two Condition. SIAM J. Disc. Math, 7:133-140, 1994.
22. A. Sen, T. Roxborough and S. Medidi: Upper and Lower-Bounds of a Class of Channel Assignmet Problems in Cellular Networks. IEEE INFOCOM 1998, 1998.
23. M. Shepherd: Radio Channel Assignment. Ph.D. thesis, Merton College, Oxford, 1998.