An Asymptotic Approach to the Channel Assignment Problem

DOI10.1137/0606050MaRDI QIDQ3701467zbMATH OpenOpenAlexFDO

Authors Joshua H. Rabinowitz, Viera Krǔanová Proulx

Publication date 1985

Published in SIAM Journal on Algebraic Discrete Methods (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0606050

zbMATH Keywords

asymptotically optimalchannel assignment problemT-coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph theory (05C99)

Recommendations

• The channel assignment problem for mutually adjacent sites
• \(T\)-colorings and \(T\)-edge spans of graphs
• \(T\)-graphs and the channel assignment problem
• \(T\)-colorings of graphs: recent results and open problems
• scientific article; zbMATH DE number 3853101

Cites work

• Circulant graph imbeddings
• scientific article; zbMATH DE number 3853101 (Why is no real title available?)
• scientific article; zbMATH DE number 3319665 (Why is no real title available?)
• Isomorphism of circulant graphs and digraphs
• Quantum private communication

Cited in

(32)

• \(T\)-colorings of graphs: recent results and open problems
• On the finite transmission zero assignment problem
• Distance graphs and \(T\)-coloring
• The channel assignment problem for mutually adjacent sites
• \(T\)-graphs and the channel assignment problem
• A doubly cyclic channel assignment problem
• Frequency-distance constraints with large distances
• Channel assignment with large demands
• Asymptotic clique covering ratios of distance graphs
• Optimal channel assignment and \(L(p,1)\)-labeling
• On the span in channel assignment problems: Bounds, computing and counting
• A channel assignment problem for optical networks modelled by Cayley graphs
• Density of sets with missing differences and applications
• Maximal density of integral sets with missing differences and the kappa values
• Sequences of integers with three missing separations
• On the span of a random channel assignment problem
• Maximal density of sets with missing differences and various coloring parameters of distance graphs
• Study of $$\kappa (D)$$ for $$D = \{2, 3, x, y\}$$
• Channel assignment on Cayley graphs
• A competitive scheduling problem and its relevance to UMTS channel assignment
• scientific article; zbMATH DE number 3873389 (Why is no real title available?)
• On Graceful Directed Graphs
• scientific article; zbMATH DE number 15260 (Why is no real title available?)
• A Theorem about the Channel Assignment Problem
• Random channel assignment in the plane
• scientific article; zbMATH DE number 4197109 (Why is no real title available?)
• scientific article; zbMATH DE number 7069664 (Why is no real title available?)
• Solution to a conjecture of Schmidt and Tuller on one-dimensional packings and coverings
• On the density of integral sets with missing differences from sets related to arithmetic progressions
• Packing density of sets with only two nonmixed gaps
• No-hole 2-distant colorings for Cayley graphs on finitely generated abelian groups
• Fractional chromatic number of distance graphs generated by two-interval sets

This page was built for publication: An Asymptotic Approach to the Channel Assignment Problem

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