Optimal channel allocation for several types of cellular radio networks

DOI10.1016/S0166-218X(97)00040-1zbMath0898.90061MaRDI QIDQ1372738

Thomas Niessen

Publication date: 12 October 1998

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

Full work available at URL: http://www.elsevier.com/locate/dam

zbMATH Keywords

optimizationalgorithmschannel allocationcellular radio networksset-valued graph colorings

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Coloring of graphs and hypergraphs (05C15) Communication theory (94A05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the continued Erlang loss function
• The maximum k-colorable subgraph problem for chordal graphs
• A solution of the Sperner-Erdős problem
• Maximum \(k\)-covering of weighted transitive graphs with applications
• Quantifiers and approximation
• On the \(k\)-coloring of intervals
• Normal hypergraphs and the perfect graph conjecture
• On Comparability and Permutation Graphs
• A new approach to the maximum-flow problem
• Fibonacci heaps and their uses in improved network optimization algorithms
• On Erlang's Formula

This page was built for publication: Optimal channel allocation for several types of cellular radio networks