Bounds for the frequency assignment problem

DOI10.1016/S0012-365X(96)00257-9zbMath0873.05041OpenAlexW2111716442MaRDI QIDQ1356496

O. Diekmann

Publication date: 8 October 1997

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(96)00257-9

zbMATH Keywords

boundsfrequency assignmenttransmitterT-colouring

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Applications of graph theory (05C90) Coloring of graphs and hypergraphs (05C15)

Related Items

An enumerative algorithm for the frequency assignment problem, New results on the robust coloring problem, Comparison of column generation models for channel assignment in cellular networks, Polyhedral studies for minimum‐span graph labelling with integer distance constraints, On the span in channel assignment problems: Bounds, computing and counting, On Interference Graphs, Lower bounding techniques for frequency assignment, Improving heuristics for the frequency assignment problem, Erratum to ``Comparison of column generation models for channel assignment in cellular networks, Generation of lower bounds for minimum span frequency assignment

Cites Work

• On the shortest spanning subtree of a graph and the traveling salesman problem
• \(T\)-colorings of graphs: recent results and open problems
• A tabu search algorithm for frequency assignment
• On the use of some known methods for \(T\)-colorings of graphs
• Solving the maximum clique problem using a tabu search approach
• Sur le coloriage des graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item