Radiocoloring in planar graphs: Complexity and approximations

Theoretical Computer Science

Volumn 340, Issue 3, 2005, Pages 514-538

  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 communication; Rapid mixing

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; FREQUENCIES; GRAPH THEORY; MOBILE COMPUTING; RADIO COMMUNICATION; SIGNAL PROCESSING;

COUPLING; PLANAR GRAPHS; RADIOCOLORING; RAPID MIXING;

COLORING;

EID: 23844489187     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2005.03.013     Document Type: Conference Paper

References (20)

1. D. Aldous, Random walks in finite groups and rapidly mixing Markov chains, in: A. Dold, B. Eckmann (Eds.), Seminaire de Probabilites XVII 1981/82, Springer Lecture Notes in Mathematics, Vol. 986, Springer, Berlin, 1982, pp. 243-297.
2. G. Agnarsson, M.M. Halldorsson, Coloring squares of graphs, SIAM J. Discrete Math., to appear.
3. A.A. Bertossi, and M.A. Bonuccelli Code assignment for hidden terminal interference avoidance in multihop packet radio networks IEEE/ACM Trans. Networking 3 4 1995 441 449
4. H.L. Bodlaender, T. Kloks, R.B. Tan, J. van Leeuwen, Approximations for λ -coloring of graphs, in: H. Reichel, S. Tison (Eds.), STACS 2000, Proc. 17th Annual Symp. on Theoretical Aspects of Computer Science, Lecture Notes in Computer Science, Vol. 1770, Springer, Berlin, 2000, pp. 395-406.
5. P. Diaconis Group Representations in Probability and Statistics 1988 Institute of Mathematical Statistics Hayward, CA
6. U. Feige, J. Kilian, Zero knowledge proofs and the chromatic number, J. Comput. Syst. Sci. 57 (1998) 187-199. Springer, New York, 1993, pp. 250-260.
7. M. Formann, T. Hagerup, J. Haralambides, M. Kaufmann, F.T. Leighton, A. Symvonis, E. Welzl, and G. Woeginger Drawing graphs in the plane with high resolution SIAM J. Comput. 22 5 1993 1035 1052
8. D. Fotakis, S. Nikoletseas, V. Papadopoulou, P. Spirakis, NP-completeness results and efficient approximations for radiocoloring in planar graphs, 25th Internat. Symp. on Mathematical Foundations of Computer Science (MFCS), Lecture Notes in Computer Science, Vol. 1893, Springer, Berlin, 2000, pp. 363-372.
9. D. Fotakis, G. Pantziou, G. Pentaris, P. Spirakis, Frequency assignment in mobile and radio networks, Networks in Distributed Computing, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Vol. 45, American Mathematical Society, Providence, RI, 1999, pp. 73-90.
10. J. Griggs, D. Liu, Minimum span channel assignments, Recent Advances in Radio Channel Assignments. Invited Minisymposium, Discrete Mathematics, 1998.
11. M. Habib, C. McDiarmid, J. Ramirez-Alfonsin, B. Reed (Eds.), Probabilistic Methods for Algorithmic Discrete Mathematics, Algorithms and Combinatorics, Vol. 16, Springer, Berlin, 1998.
12. W.K. Hale Frequency assignment theory and applications Proc. IEEE 68 12 1980 1497 1514
13. J.VanD. Heuvel, S. McGuiness, Colouring the square of a planar graph, CDAM Research Report Series, July 1999.
14. M. Jerrum A very simple algorithm for estimating the number of k-colourings of a low degree graph Random Struct. Algorithms 7 1994 157 165
15. M. Jerrum Markov chain Monte Carlo method Probabilistic Methods for Algorithmic Discrete Mathematics 1998 Springer Berlin
16. D.R. Karger, and C. Steinm A new approach to the minimum cut problem J. ACM 43 4 1996 601 640
17. I. Katsela, and M. Nagshineh Channel assignment schemes for cellular mobile telecommunication systems IEEE Personal Communication Complexity 1070 1996
18. D. Lichtenstein Planar formulae and their uses SIAM J. Comput. 11 2 1982 329 343
19. Y.L. Lin, and S. Skiena Algorithms for square roots of graphs SIAM J. Discrete Math. 8 1995 99 118
20. S. Ramanathan, E.R. Loyd, The complexity of distance2-coloring, 4th Internat. Conf. of Comput. Inform. 1992, pp. 71-74.