A Hamiltonian approach to the assignment of non-reusable frequencies

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

Volumn 1530 LNCS, Issue , 1998, Pages 18-30

  Fotakis, Dimitris A ^a,b   Spirakis, Paul G ^a,b  

^a UNIVERSITY OF PATRAS   (Greece)

^b University of Patras and Computer Technology Institute   (Greece)

Author keywords

[No Author keywords available]

Indexed keywords

ADJACENT VERTICES; COMBINATORIAL MODELING; FREQUENCY ASSIGNMENTS; GENERAL GRAPH; HAMILTONIAN APPROACH; MAXIMUM DEGREE; PLANAR GRAPH; POLYNOMIAL-TIME ALGORITHMS;

APPROXIMATION ALGORITHMS; RADIO TRANSMISSION; SOFTWARE ENGINEERING;

GRAPH THEORY;

EID: 84887113530     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-49382-2_3     Document Type: Conference Paper

References (14)

1. S.M. Allen, D.H. Smith, and S. Hurley. Lower Bounding Techniques for Frequency Assignment. Submitted to Discrete Mathematics, 1997. 19
2. N. Christofides. Worst-Case Analysis of a New Heuristic for the Travelling Salesman Problem. Symposium on new directions and recent results in algorithms and complexity, p. 441, 1976. 20
3. W. Fernandez de la Vega and M. Karpinski. On Approximation Hardness of Dense TSP and other Path Problems. Electronic Colloquium on Computational Complexity TR98-024, 1998. 20
4. D. Fotakis, G. Pantziou, G. Pentaris, and P. Spirakis. Frequency Assignment in Mobile and Radio Networks. To appear in Proc. of the Workshop on Networks in Distributed Computing, DIMACS Series, AMS, 1998. 19
5. R.A.H. Gower and R.A. Leese. The Sensitivity of Channel Assignment to Constraint Specification. Proc. of the 12th International Symposium on Electromagnetic Compatibility, pp. 131-136, 1997. 18, 19
6. W.K. Hale. Frequency Assignment: Theory and Applications. Proceedings of the IEEE 68(12), pp. 1497-1514, 1980. 18, 19
7. F. Harary. Personal Communication. 1997. 19
8. J. van den Heuvel, R.A. Leese, and M.A. Shepherd. Graph Labelling and Radio Channel Assignment. Manuscript available from http://www.maths.ox.ac.uk/ users/gowerr/preprints.html, 1996. 18, 19
9. A. Israeli and Y. Shiloach. An improved algorithm for maximal matching. Information Processing Letters 33, pp. 57-60, 1986.
10. M. Karpinski. Polynomial Time Approximation Schemes for Some Dense Instances of NP-hard Optimization Problems. Proc. of the 1st Symposium on Randomization and Approximation Techniques in Computer Science, pp. 1-14, 1997. 20
11. S. Khanna and K. Kumaran. On Wireless Spectrum Estimation and Generalized Graph Coloring. Proc. of the 17th Joint Conference of IEEE Computer and Communications Societies-INFOCOM, 1998. 19
12. C.H. Papadimitriou. Personal Communication. 1998. 29
13. C.H. Papadimitriou and M. Yannakakis. The Traveling Salesman Problem with Distances One and Two. Mathematics of Operations Research 18(1), pp. 1-11, 1993. 19, 21
14. A. Raychaudhuri. Intersection assignments, T-colourings and powers of graphs. PhD Thesis, Rutgers University, 1985.