Optimizing distance constraints frequency assignment with relaxation

DOI10.1051/RO/2020043MaRDI QIDQ5002297zbMATH OpenOpenAlexFDO

Authors Zehui Shao, Jin Xu, Aleksander Vesel, Xiujun Zhang, Enqiang Zhu

Publication date 27 July 2021

Published in RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1051/ro/2020043

zbMATH Keywords

\((s,t)\)-relaxed \(L(2, 1)\)-labeling\(L(2, 1)\)-labelingfrequency assignment

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Applications of graph theory (05C90) Communication theory (94A05)

Recommendations

• Frequency assignment problem in networks with limited spectrum
• Bounds for the frequency assignment problem
• The edge span of distance two labellings of graphs
• Exact solution of a class of frequency assignment problems in cellular networks (extended abstract)
• scientific article; zbMATH DE number 1263991

This page was built for publication: Optimizing distance constraints frequency assignment with relaxation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5002297)