Lower Bounds from Tile Covers for the Channel Assignment Problem

DOI10.1137/S0895480101384402MaRDI QIDQ5317580zbMATH OpenOpenAlexFDO

Authors T. E. Wentzell, S. L. Fitzpatrick, Jeannette Janssen

Publication date 16 September 2005

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

labelingpolyhedral lower bounds

Mathematics Subject Classification ID

Graph labelling (graceful graphs, bandwidth, etc.) (05C78) General topics of discrete mathematics in relation to computer science (68R01) Discrete location and assignment (90B80) Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• Lower bounding techniques for frequency assignment
• Tight lower bound for the channel assignment problem
• scientific article; zbMATH DE number 1488080
• An improved algorithm to determine lower bounds for the fixed spectrum frequency assignment problem
• scientific article; zbMATH DE number 1990680

Cited in

(1)

• Models and solution techniques for frequency assignment problems

This page was built for publication: Lower Bounds from Tile Covers for the Channel Assignment Problem

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