Radio labeling with preassigned frequencies

SIAM Journal on Optimization

Volumn 15, Issue 1, 2005, Pages 1-16

  Bodlaender, Hans L ^a   Broersma, Hajo ^b   Fomin, Fedor V ^c   Pyatkin, Artem V ^d   Woeginger, Gerhard J ^b  

^a UTRECHT UNIVERSITY   (Netherlands)

^b UNIVERSITY OF TWENTE   (Netherlands)

^c UNIVERSITY OF BERGEN   (Norway)

^d SOBOLEV INSTITUTE OF MATHEMATICS   (Russian Federation)

Author keywords

Approximation algorithm; Cograph; Computational complexity; Frequency assignment; Graph algorithms; k coloring; Radio labeling

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; MATHEMATICAL MODELS; MOBILE TELECOMMUNICATION SYSTEMS; NATURAL FREQUENCIES; POLYNOMIALS; RADIO COMMUNICATION; RADIO INTERFERENCE; SET THEORY; TRANSMITTERS;

APPROXIMATION ALGORITHMS; COGRAPHS; FREQUENCY ASSIGNMENT PROBLEMS (FAP); GRAPH ALGORITHMS; K-COLORING; RADIO LABELING;

GRAPH THEORY;

EID: 14944376914     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/S1052623402410181     Document Type: Article

References (19)

1. H. L. BODLAENDER, T. KLOKS, R. B. TAN, AND J. VAN LEEUWEN, λ-coloring of graphs, in Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science, Lecture Notes in Comput. Sci. 1770, Springer, Berlin, 2000, pp. 395-406.
2. G. J. CHANG AND D. KUO, The L(2, 1)-labeling problem on graphs, SIAM J. Discrete Math., 9 (1996), pp. 309-316.
3. P. DAMASCHKE, J. S. DEOGUN, D. KRATSCH, AND G. STEINER, Finding Hamiltonian paths in cocomparability graphs using the bump number algorithm, Order, 8 (1992), pp. 383-391.
4. L. ENGEBRETSEN, An explicit lower bound for TSP with distances one and two, in Proceedings of the 16th Annual Symposium on Theoretical Aspects of Computer Science, Lecture Notes in Comput. Sci. 1563, Springer, Berlin, 1999, pp. 373-382.
5. J. FIALA, A. V. FISHKIN, AND F. V. FOMIN, Off-line and on-line distance constrained labeling of graphs, in Proceedings of the 9th European Symposium on Algorithms, Lecture Notes in Comput. Sci. 2161, Springer, Berlin, 2001, pp. 464-475.
6. J. FIALA, J. KRATOCHVÍL, AND T. KLOKS, Fixed-parameter complexity of λ-labelings, Discrete Appl. Math., 113 (2001), pp. 59-72.
7. J. FIALA, J. KRATOCHVÍL, AND A. PROSKUROWSKI, Distance constrained labelings of precolored trees, in Proceedings of the 7th Italian Conference on Theoretical Computer Science, Lecture Notes in Comput. Sci. 2202, Springer, Berlin, 2001, pp. 285-292.
8. D. A. FOTAKIS AND P. G. SPIRAKIS, A Hamiltonian approach to the assignment of non-reusable frequencies, in Proceedings of the 18th Conference on Foundations of Software Technology and Theoretical Computer Science, Lecture Notes in Comput. Sci. 1530, Springer, Berlin, 1998, pp. 18-29.
9. D. A. FOTAKIS, S. E. NIKOLETSEAS, V. G. PAPADOPOULOU, AND P. G. SPIRAKIS, Hardness results and efficient approximations for frequency assignment problems and the radio coloring problem, Bull. Eur. Assoc. Theor. Comput. Sci. EATCS, 75 (2001), pp. 152-180.
10. M. R. GAREY AND D. S. JOHNSON, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman, New York, 1979.
11. P. GOLOVACH, Systems of pairs of q-distant representatives, and graph colorings, Zap. Nauchn. Sem. S.-Peterburg. Otdel. Mat. Inst. Steklov. (POMI), 293 (2002), pp. 5-25 (in Russian).
12. J. R. GRIGGS AND R. K. YEH, Labelling graphs with a condition at distance 2, SIAM J. Discrete Math., 5 (1992), pp. 586-595.
13. M. HABIB, R. H. MÖHRING, AND G. STEINER, Computing the bump number is easy, Order, 5 (1988), pp. 107-129.
14. W. K. HALE, Frequency assignment: Theory and applications, Proc. IEEE, 68 (1980), pp. 1497-1514.
15. J. VAN DEN HEUVEL, R. A. LEESE, AND M. A. SHEPHERD, Graph labeling and radio channel assignment, J. Graph Theory, 29 (1998), pp. 263-283.
16. R. A. LEESE, Radio spectrum: A raw material for the telecommunications industry, in Progress in Industrial Mathematics at ECMI 98, Teubner, Stuttgart, 1999, pp. 382-396.
17. C. H. PAPADIMITRIOU AND M. YANNAKAKIS, The travelling salesman problem with distances one and two, Math. Oper. Res., 18 (1993), pp. 1-11.
18. D. SAKAI, Labeling chordal graphs: Distance two condition, SIAM J. Discrete Math., 7 (1994), pp. 133-140.
19. A. A. SCHÄFFER AND B. B. SIMONS, Computing the bump number with techniques from two-processor scheduling, Order, 5 (1988), pp. 131-141.