Hardness results and efficient approximations for frequency assignment problems: Radio labelling and radio coloring

Computing and Informatics

Volumn 20, Issue 2, 2001, Pages 121-180

  Fotakis, D A ^a   Nikoletseas, S E ^a   Papadopoulou, V G ^a   Spirakis, P G ^a  

^a UNIVERSITY OF PATRAS   (Greece)

Author keywords

Approximations; Coloring; Computational complexity; Coupling; Mobile computing; Planar graphs; Radio networks; Rapid mixing

Indexed keywords

EID: 0346250726     PISSN: 13359150     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (96)

1. AGNARSSON, G. - HALLDÓRSSON, M. M.: Coloring Powers of planar graphs. Symposium On Discrete Algorithms (SODA), 2000.
2. ARDAAL, K. I. - HIPOLITO, A. - VAN HOESEL, C. P. M. - JOESEN, B. - ROOS, C. - TERLAKY, T.: A branch-and-cut algorithm for frequency assignment problem. EUCLID CALMA Project, Delft and Eindhoven Universities of Technology, The Netherlands, 1995.
3. ALDOUS, D.: Random walks in finite groups and rapidly mixing Markov Chains. Seminaire de Probabilites XVII 1981/82 (A. Dold and B. Eckmann, eds.), Springer Lecture Notes in Mathematics 986, pp. 243-297, 1982.
4. AARDAL, K. - HURKENS, C. A. J. - LENSTRA, J. K. - TIOURINE, S. R.: Algorithms for Frequency Assignment Problems. CWI Quarterly, Vol. 9, 1996, pp. 1-9.
5. ANDERSON, L.: A Simulation: Study of some dynamic channel assignment algorithms in High Capacity Mobile Telecommunications Systems. IEEE Transactions on Vehicular Technology, Vol. 22, 1973.
6. ALLEN, S. M. - SMITH, D. H. - HURLEY, S.: Lower Bounding Techniques for Frequency Assignment. Discrete Mathematics, 1998.
7. ALON, N. - TARSI, M.: Coloring and Orientation of graphs. Combinatorica, Vol. 12, 1992, No. 2, pp. 125-134.
8. BERTOSSI, A. A. - BONUCCELLI, M. A.: Code assignment for hidden terminal interference avoidance in multihop packet radio networks. IEEE/ACM Trans. Networking, Vol. 3-4, Aug. 1995, pp. 441-449.
9. ARORA, S. - LUND, C. - MOTWANI, R. - SUDAN, M. - SZEGEDY, M.: Proof verification and hardness of approximation problems. Proc. of the 33th Annual IEEE Symposium on Foundations of Computer Science, pp. 14-23, 1992.
10. BEHZAD, M.: A criterion for the planarity of total graph. Proc. Cambridge Philos. Soc., Vol. 63, 1972, pp. 679-681.
11. BRELAZ, D.: New methods to color the vertices of a graph. Communications ACM. Vol. 22, 1979, pp. 251-256.
12. BERGE, C.: Graphs (second edition). North Holland, 1985.
13. BODLAENDER, H. L. - KLOKS, T. - TAN, R. B. - VAN LEEUWEN, J.: Approximations for λ-coloring of graphs. In STACS 2000 (H. Reichel and S. Tison, eds.), Proc. 17th Annual Symp. on Theoretical Aspects of Computer Science. Lecture Notes in Computer Science, Vol. 1770, pp. 395-406, Springer-Verlag, Berlin 2000.
14. CARAGIANNIS, I. - KAKLAMANIS, C. - PAPAIOANNOU, E.: Efficient On-line Communication in Cellular Networks. 12th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA 00), pp. 46-53, 2000.
15. CASTELINO, D. J. - HURLEY, S. - STEPHENS, N. M.: A Tabu search algorithm for frequency assignment. Annals of Operations Research, Vol. 41, 1993, 00343-358.
16. COX, P. J. - REUDINK: Dynamic Channel Assignment in Two Dimension Large-Scale Mobile Radio Systems. The Bell System Technical Journal, Vol. 51, 1972.
17. CHROBAK, M. - NISHIZEKI, T.: Improved edge-coloring algorithms for planar graphs. Journal of Algorithms, Vol. 11, 1990, pp. 102-116.
18. CHROBAK, M. - YUNG, M.: Fast algorithms for edge coloring planar graphs. Journal of Algorithms, Vol. 10, 1989, pp. 35-51.
19. CHRISTOFIDES, N.: Worst-Case Analysis of a New Heuristic for the Travelling Salesman Problem. Symposium on new directions and recent results in algorithms and complexity (J. F. Traub, ed.), pp. 441, 1976.
20. COZZENS, M. B. - ROBERTS, F. S.: T-coloring of graphs and the channel assignment problem. Congresus Numeratium, Vol. 35, 1982, pp. 191-208.
21. DÍAZ, J. - SERNA, M. J. - SPIRAKIS, P. - TORÁN, J.: Paradigms for Fast Parallel Approximability. Cambridge University Press, 1997.
22. DAS, S. K. - SEN, S. K. - JAYARAM, R.: A Structured Channel Borrowing Scheme for Dynamic Load Balancing in Cellular Networks. ICDCS 97.
23. DONG, X. - LAI, T. H.: Distributed Dynamic Carrier Allocations in Mobile Cellular Networks. Search vs. Update, IEEE 97, 1997.
24. DIACONIS, P.: Group representations in probability and statistics. Institute of Mathematical Statistics, Hayward CA, 1988.
25. ENGEL, J. S. - PERITSKY, M.: Statistically-Optimum Dynamic Server Assignment in Systems with Interfering Servers. IEEE Transactions on Vehicular Technology, VT Vol. 22, 1991, pp. 203-210.
26. ERDOS, P. - RUBIN, A. H.: Taylor: Choosability in graphs. Proceedings of West Coast Conference on Combinatorics, 1979, pp. 125-157.
27. FOTAKIS, D.: Approximate Solution of Computationally Hard Problems: Algorithms and Complexity. PhD Thesis, Computer Engineering and Informatics Department, University of Patras, 1999.
28. FOTAKIS, D. - SPIRAKIS, P.: Assignment of Reusable and Non-Reusable Frequencies. International Conference on Combinatorial and Global Optimization, Crete, Greece, 1998.
29. FOTAKIS, D. - PANTZIOU, G. E. - PENTARIS, G. - SPIRAKIS, P.: Assignment of Frequencies in Mobile and Radio Networks. Invited talk in DIMACS Workshop on Networks and Distributed Computing, 1997.
30. FOTAKIS, D. - SPIRAKIS, P.: A Hamiltonian Approach to the Assignment of Non-Reusable Frequencies. 18th Conference on the Foundations of Software Technology and Theoretical Computer Science (FCS&TCS 98), pp. 18-29, Springer-Verlag, 1998.
31. FOTAKIS, D. A. - NIKOLETSEAS, S. E. - PAPADOPOULOU, V. G. - SPIRAKIS, P. G.: NP-completeness Results and Efficient Approximations for Radiocoloring in Planar Graphs. CTI Technical Report, 2000. Available from www.cti.gr/RD1.
32. FOTAKIS, D. A. - NIKOLETSEAS, S. E. - PAPADOPOULOU, V. G. - SPIRAKIS, P. G.: NP-completeness Results and Efficient Approximations for Radiocoloring in Planar Graphs. In the Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science (MFCS), LNCS 1893 (M. Nielsen, B. Rovan, eds.), pp. 363-372, 2000.
33. FERNANDEZ DE LA VEGA, W. - KARPINSKI, M.: On Approximation Hardness of Dense TSP and other Path Problems. Available from http://cs.uni-bonn.de/ info5/publications/CS-1998-en.html, 1998.
34. GAREY, M. R. - JOHNSON, D. S. - STOCKMEYER, L.: Some simplified NP-complete graph problems. Theor. Comput. Sci., Vol. 1, 1976, pp. 237-267.
35. GAREY, M. R. - JOHNSON, D. S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco, 1979.
36. GRIGGS, J. - LIU, D.: Minimum Span Channel Assignments. To appear in Recent Advances in Radio Channel Assignment. Satellite Symposium to 9th SIAM Conf. on Discrete Mathematics, July 1998.
37. GOODMAN, D. J. - SUGLA, B.: Signaling system draft. Unpublished manuscript.
38. GOODMAN, D. J.: Trends in Cellular and Cordless Communications. IEEE Communication Magazine, June 1991.
39. GOWER, R. A. H. - LEESE, R. A.: The Sensitivity of Channel Assignment to Constraint Specification. 12th International Symposium on Electromagnetic Compatibility, pp. 131-136, 1997.
40. GRIGGS, J. - LIU, D.: Minimum Span Channel Assignments. Recent Advances in Radio Channel Assignments. Invited Minisymposium, Discrete Mathematics, 1998.
41. GOLDBERG, D. E.: Genetic algorithms in search. Optimization and Machine Learning, Addison-Wesley, Reading MA, 1989.
42. HALE, W. K.: Frequency Assignment: Theory and Applications. Proceedings of the IEEE, Vol. 68, 1980, No. 12, pp. 1497-1514.
43. HURLEY, S. - SMITHA, D. H. - TIEL, S. U.: Frequency Assignment Algorithms. Radiocommunications Agency Agreement, Ref. RCCM 070. Final Report Year 2, http://www.cs.cf.ac.uk/User/Steve.Hurley/freq.htm, 1997.
44. HURKENS, C.: CALMA: Combinatorial Algorithms for Military Applications. http://www.win.tue.nl/math/bs/comb_opt/hurkens/calma.html1997.
45. HARARY, F.: Personal Communication, 1997.
46. HARARY, F.: Graph Theory. Addison Wesley Publishing Company, 1969.
47. HOROWITZ, E. - SAHNI, S.: Fundamentals of Computer Algorithms. Pitman, 1978.
48. VAN DEN HEUVEL, J. - LEESE, R. A. - SHEPHERD, M. A.: Graph Labelling and Radio Channel Assignment. Journal of Graph Theory, Vol. 29, 1998, pp. 263-28.
49. VAN DEN HEUVEL, J. - MCGUINESS, S.: Colouring the square of a Planar Graph. CDAM Research Report Series, Jule 1999.
50. JERRUM, M.: A very simple algorithm for estimating the number of fc-colourings of a low degree graph. Random Structures and Algorithms, Vol. 7, 1994, pp. 157-165.
51. JERRUM, M.: Markov Chain Monte Carlo Method. Probabilistic Methods for Algorithmic Discrete Mathematics (M. Habib, C. McDiarmid, J. Ramirez-Alfonsin and B. Reed, eds.) Springer Verlag, 1998.
52. ISRAELI, A. - SHILOACII, Y.: An improved algorithm for maximal matching. Information Processing Letters, Vol. 33, 1986, pp. 57-60.
53. KARGER, D. - MOTWANI, R. - SUDAN, M.: Approximate graph coloring by semidefinite programming. Proc. of the 35th IEEE Symposium on Foundations of Computer Science, pp. 2-13, 1994.
54. KARPINSKI, M.: Polynomial Time Approximation Schemes for Some Dense Instances of AfP-hard Optimization Problems. Proc. of the 1st Symposium on Randomization and Approximation Techniques in Computer Science, pp. 1-14, 1997.
55. KARGER, D. R. - STEINM, C.: A new approach to the minimum cut problem. Journal of the ACM, Vol. 43, July 1996, No. 4, pp. 601-640.
56. KHANNA, S. - KUMARAN, K.: On wireless Spectrum Estimation and Generalized Graph coloring. Proceedings of the 17th Joint Conference of IEEE Computer and Communications Science, pp. 2-13, 1995.
57. KHANNA, S. - LINIAL, N. - SAFRA, S.: On the hardness of approximating the chromatic number. Proc. 2nd Israel Symposium on Theory and Computing Systems (ISTCS), pp. 250-260, 1993.
58. KATSELA, I. - NAGSHINEH, M.: Channel Assignment Schemes for Cellular Mobile Telecommunication Systems. IEEE Personal Communication Complexity, Vol. 1070, 1996.
59. KIRKPARTICK, S. - GELATT JR., C. D. - VECCHI, M. P: Optimization by simulated annealing, Science, Vol. 220, 1983, pp. 671-680.
60. KUBOTA, F. - OKADA: A Proposal of a Dynamic Channel Assignment Strategy with Information of moving Directions. IEICE Transactions Fundamentals, Vol. 75, 1992.
61. KUBOTA, F. - OKADA: Dynamic Channel Assignment Strategies in Cellular Mobile Radio Systems. IEICE Transactions Fundamentals, Vol. 75, 1992.
62. KRUMKE, M. V. M. - RAVI, S. S.: Approximation algorithms for channel assignment in radio networks. In DIALM for Mobility, 2nd International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications, Dallas, Texas, 1998.
63. LANFEAR, T. A.: Graph Theory and Radio Frequency Assignment. Technical Report, Allied Frequency Agency NATO Headquarters, B-1110, Brussels, Belgium, 1989.
64. LICHTENSTEIN, D.: Planar formulae and their uses. Siam J. Comput., Vol. 11, May 1982, No 2.
65. LEESE, R. A.: A unified approach to the assignment of radio channels on a regular hexagonal grid. IEEE Transactions on Vehicular Technology, 1997.
66. LUND, C. - YANNAKAKIS, M.: On the Hardness of Approximating Minimization Problems. Journal of Association for Computing Machinery, Vol. 41, pp. 960-981, 1994.
67. LIN, Y.-L. - SKIENA, S.: Algorithms for square roots of graphs. SIAM J. Disc. Math, 1995.
68. LEESE, R. A.: A Unified Approach to the Assignment of Radio Channels on a Regular Hexagonal Grid. IEEE Transactions on Vehicular Technology, 1998.
69. MALESINSCA, E.: An optimization method for Channel Assignment in Mixed Environments. Proc. of ACM MOBICOM, 1995.
70. MALESINSKA, E.: Graph-theoretical models of Frequency Assignment Problems. PhD, Berlin 1997.
71. MCCORMlCK, S. T.: Optimal approximation of sparse hessians and equivalence to a graph coloring problem. Math. Programming, Vol. 26, 1983, No. 2, pp. 153-171.
72. METZGER, B. H.: Spectrum management techniques. 38th National ORSA Meeting, Detroit, MI, 1970.
73. MURPHEY, R. A. - PARDALOS, P. M. - RESENDE, M. G. C.: Frequency Assignment Problems. Handbook of Combinatorial Optimization, Kluwer Academic Publishers, 1999.
74. MCDIARMID, C. - REED, B.: On total Colouring of graphs. Journal of Combinatorial Theory, Series B57, 1993, pp. 122-130.
75. MOTWANI, R. - SUDAN, M.: Square is NP-complete. Manuscript, September 1991.
76. NASH-WILIAMS, C. S. J. A.: Decomposition of finite graphs into forests. J. London Math. Soc., Vol. 39, 1964, No. 12.
77. NARAYANAN, L. - SHENDE, S.: Static Frequency Assignment in Cellular Networks. Proc. of the 4th International Colloquium on Structural Information and Communication Complexity, 1997.
78. PANTZIOU, G. - PENTARIS, G. - SPIRAKIS, P.: Competitive Control in Mobile Networks. Proc. of the 8th International Symposium on Algorithms and Computation, 1997, pp. 404-413.
79. PAPADIMITRIOU, C. H. - YANNAKAKIS, M.: The Traveling Salesman Problem with Distances One and Two. Mathematics of Operations Research, Vol. 18, 1993, No. 1, pp. 1-11.
80. PAPADIMITRIOU, C. H.: Computational Complexity. Addisson-Wesley Publishing Company, 1994.
81. PANCONESI, A. - SRINIVASAN, A.: Improved distributed algorithms for coloring and network decomposition problems. Proc. of ACM STOC, 1992.
82. PEEMOLER, J.: A correction to Brelaz's modification of Brown's coloring algorithm. Communications of the ACM, Vol. 26, 1983, No. 8, pp. 327-345.
83. PRAKASH, R. - SHIVARATRI, N. - SIGHAL, M.: Distributed Dynamic Channel Allocation for Mobile Computing. Proc. of ACM PODC, 1995.
84. RAMANATHAN, S. - LOYD, E. R.: The complexity of distance-2-coloring. 4-th International Conference of Computing and Information, 1992, pp. 71-74.
85. RAMANATHAN, S. - LOYD, E. R.: Scheduling algorithms for Multi-hop Radio Networks. IEEE/ACM Trans. on Networking, Vol. 1, April 1993, No. 2, pp. 166-172.
86. RAYCHAUDHURI, A.: Intersection Assignments, T-colourings and powers of graphs. PhD. Thesis, Rutgers University, 1985.
87. ROBERTS, F. S.: No-hale 2-distance colorings. Math. Comput. Modelling, Vol. 17, 1993, No. 11, pp. 139-144.
88. ROBERTSON, N. - SANDERS, D. - SEYMOUR, P. - THOMAS, R.: The Four-Colour Theorem, J. Comp. Th., Vol. 70, 1997, pp. 2-44.
89. '89] SMITH, D. H. - HURLEY, S.: Bounds for the frequency assignment problem. Discrete Mathematics, Vol. 168, 1997, pp. 571-582.
90. SUNGH, R. - ELNOUBI, S. - GOUPTA, C.: A new Frequency Assignment Algorithm in High Capacity Mobile Telecommunication Systems. IEEE Transactions on Vehicular Technology, Vol. 31, 1982.
91. TESMAN, B. A.: Set T-coloring. Congrussus Numeratium, Vol. 77, 1990, pp. 229-242.
92. THOMASSEN, C.: Every planar graph is 5-choosable. Journal of Comb.Theory (B), Vol. 62, 1994, pp. 180-181.
93. TOMSON, J. - GEORGANAS, N.: A Hybric Channel Assignment Scheme in Large Scale Cellular-Structured Mobile Communication Systems. IEEE Transactions on Communications, Vol. 26, 1978.
94. TIOURINE, S. - HURKENS, C. - LENSTRA, J. K.: An Overview of Algorithmic Approaches to Frequency Assignment Problems. Technical Report, Eindhoven University of Technology, 1995.
95. ZHANG, M.: Comparison of Channel Assignment Strategies in Cellular Mobile Phone Systems. IEEE Transactions on Vehicular Technology, Vol. 37, 1989.
96. WEGNER, G.: Graphs with given diameter and a coloring problem. Technical report, University of Dortmund, 1977.