Lower Bounds from Tile Covers for the Channel Assignment Problem
Copyright policy )Lower Bounds from Tile Covers for the Channel Assignment Problem
Summary: A method to generate lower bounds for the channel assignment problem is given. The method is based on the reduction of the channel assignment problem to a problem of covering the demand in a cellular network by preassigned blocks of cells called tiles. This tile cover approach is applied to networks with a cosite constraint and two different constraints between cells. A complete family of lower bounds is obtained, which include a number of new bounds that improve or include almost all known clique bounds. When applied to an example from the literature, the new bounds give better results.
- Dalhousie University Canada
Graph labelling (graceful graphs, bandwidth, etc.), Discrete location and assignment, Polyhedral combinatorics, branch-and-bound, branch-and-cut, polyhedral lower bounds, General topics of discrete mathematics in relation to computer science, Programming involving graphs or networks, labeling
Graph labelling (graceful graphs, bandwidth, etc.), Discrete location and assignment, Polyhedral combinatorics, branch-and-bound, branch-and-cut, polyhedral lower bounds, General topics of discrete mathematics in relation to computer science, Programming involving graphs or networks, labeling
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).2 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!