On the span in channel assignment problems: bounds, computing and counting-Reference-Cited by-同舟云学术

On the span in channel assignment problems: bounds, computing and counting

Published:2003-05 Issue:1-3 Volume:266 Page:387-397
ISSN:0012-365X
Container-title:Discrete Mathematics
language:en
Short-container-title:Discrete Mathematics

Author:

McDiarmid Colin

Publisher

Elsevier BV

Subject

Discrete Mathematics and Combinatorics,Theoretical Computer Science

Reference13 articles.

1. F. Barasi, J. van den Heuvel, Graph labelling, orientations, and greedy algorithms, 2001, in preparation.

2. Free bits, PCPs and non-approximability—towards tight results;Bellare;SIAM J. Comput.,1998

3. Frequency assignment;Hale;Proc. IEEE,1980

4. R.A. Leese, S. Hurley (Eds.), Methods and Algorithms for Radio Channel Assignment, Oxford University Press, Oxford, 2003, pp. 63–87.

5. A note on the complexity of the chromatic number problem;Lawler;Inform. Process. Lett.,1976

Cited by 27 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Blockchain-based Transaction Group Key Management Scheme For Edge Devices;2023 IEEE International Conferences on Internet of Things (iThings) and IEEE Green Computing & Communications (GreenCom) and IEEE Cyber, Physical & Social Computing (CPSCom) and IEEE Smart Data (SmartData) and IEEE Congress on Cybermatics (Cybermatics);2023-12-17

2. Tight Lower Bound for the Channel Assignment Problem;ACM Transactions on Algorithms;2016-09-02

3. Generalized edge-colorings of weighted graphs;Discrete Mathematics, Algorithms and Applications;2016-02-26

4. Efficient approximation algorithms for bandwidth consecutive multicolorings of graphs;Theoretical Computer Science;2015-11

5. Assigning Channels Via the Meet-in-the-Middle Approach;Algorithmica;2015-05-13