Bounds for the frequency assignment problem
Discrete Mathematics
Free Bits, PCPs, and Nonapproximability---Towards Tight Results
SIAM Journal on Computing
Regular Article: Arrangements, Channel Assignments, and Associated Polynomials
Advances in Applied Mathematics
Frequency-distance constraints with large distances
Discrete Mathematics
An exact algorithm for the channel assignment problem
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Labeling planar graphs with a condition at distance two
European Journal of Combinatorics
Optimal frequency assignments of cycles and powers of cycles
International Journal of Mobile Network Design and Innovation
Distance constrained labelings of planar graphs with no short cycles
Discrete Applied Mathematics
Graph labellings with variable weights, a survey
Discrete Applied Mathematics
An exact algorithm for the channel assignment problem
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Channel assignment via fast zeta transform
Information Processing Letters
On L(2,1)-coloring split, chordal bipartite, and weakly chordal graphs
Discrete Applied Mathematics
Hi-index | 0.00 |
The channel assignment problem involves assigning radio channels to transmitters, using a small span of channels but without causing excessive interference. We consider a standard model for channel assignment, the constraint matrix model, which extends ideas of graph colouring. Given a graph G = (V,E) and a length l(uv) for each edge uv of G, we call an assignment φ : V → {1,...,t} feasible if |φ(u)-φ(v)| ≥ l(uv) for each edge uv. The least t for which there is a feasible assignment is the span of the problem. We first derive two bounds on the span, an upper bound (from a sequential assignment method) and a lower bound. We then see that an extension of the Gallai-Roy theorem on chromatic number and orientations shows that the span can be calculated in O(n!) steps for a graph with n nodes, neglecting a polynomial factor. We prove that, if the edge-lengths are bounded, then we may calculate the span in exponential time, that is, in time O(cn) for a constant c. Finally we consider counting feasible assignments and related quantities.