NP-completeness results and efficient approximations for radiocoloring in planar graphs

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

Volumn 1893, Issue , 2000, Pages 363-372

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

^a UNIVERSITY OF PATRAS   (Greece)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL OPTIMIZATION; FREQUENCY ALLOCATION; GRAPHIC METHODS; POLYNOMIAL APPROXIMATION; RADIO TRANSMISSION; SIGNAL INTERFERENCE;

DISCRETE NUMBERS; FREQUENCY ASSIGNMENT PROBLEM; FREQUENCY RE-USE; FULLY POLYNOMIAL RANDOMIZED APPROXIMATION SCHEMES; GRAPH COLORING PROBLEM; MINIMUM DISTANCE; RADIOCOLORING PROBLEMS; TIME ALGORITHMS;

GRAPH THEORY;

EID: 84959210860     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44612-5_32     Document Type: Conference Paper

References (12)

1. D. Aldous: 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 Mathematis 986 (1982) 243-297.
2. Geir Agnarsson, Magnus M. Hallorsson: Coloring Powers of planar graphs. Symposium of Discrete Algorithms (2000).
3. Alan A. Bertossi and Maurizio A. Bonuccelli: Code assignment for hidden terminal interference avoidance in multihop packet radio networks. IEEE/ACM Trans. Networking 3, 4 (Aug. 1995) 441-449.
4. P. Diaconis: Group representations in probability and statistics. Institute of Mathematical Statistics, Hayward CA, (1988).
5. D. Fotakis, G. Pantziou, G. Pentaris and P. Spirakis: Frequency Assignment in Mobile and Radio Networks. Networks in Distributed Computing, DIMACS Series in Discrete Mathematics and Theoretical Computer Science 45 American Mathematical Society (1999) 73-90.
6. D.A. Fotakis, S.E. Nikoletseas, V.G. Papadopoulou and P.G. Spirakis: NP-completeness Results and Efficient Approximations for Radiocoloring in Planar Graphs. CTI Technical Report (2000) (url: http://www.cti.gr/RD1).
7. D. Fotakis and P. Spirakis: Assignment of Reusable and Non-Reusable Frequencies. International Conference on Combinatorial and Global Optimization (1998).
8. J. Van D. Heuvel and S. McGuiness: Colouring the square of a Planar Graph. CDAM Research Report Series, Jule (1999).
9. M. Jerrum: A very simple algorithm for estimating the number of k-colourings of a low degree graph. Random Structures and Algorithms 7 (1994) 157-165.
10. M. Jerrum: Markov Chain Monte Carlo Method. Probabilistic Methods for Algorithmic Discrete Mathematics, Springer (1998).
11. S. Ramanathan, E. R. Loyd: Scheduling algorithms for Multi-hop Radio Networks. IEEE/ACM Trans. on Networking, 1(2): (April 1993) 166-172.
12. S. Ramanathan, E. R. Loyd: The complexity of distance2-coloring. 4th International Conference of Computing and information, (1992) 71-74.