Lower Bounds from Tile Covers for the Channel Assignment Problem.
Jeannette C. M. JanssenTania E. WentzellShannon L. FitzpatrickPublished in: SIAM J. Discret. Math. (2005)
Keyphrases
- lower bound
- np hard
- upper bound
- branch and bound algorithm
- branch and bound
- multi channel
- worst case
- lower and upper bounds
- communication channels
- objective function
- randomly generated problems
- optimal cost
- multiple access
- search algorithm
- vc dimension
- lower bounding
- book covers
- set of randomly generated instances
- upper and lower bounds
- integer programming
- optimal solution
- max sat
- online algorithms
- quadratic assignment problem
- low complexity
- special case