Channel assignment with large demands

DOI10.1023/A:1014951015725zbMATH Open1015.90018OpenAlexW29466429MaRDI QIDQ1599337FDOQ1599337

Authors: Stefanie Gerke, Colin McDiarmid 

Publication date: 9 June 2002

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1014951015725

Recommendations

• scientific article; zbMATH DE number 3873389
• Assigning channels via the meet-in-the-middle approach
• Assigning channels via the meet-in-the-middle approach
• Channel Assignment in Multimedia Cellular Networks
• Utility and expandability of channel assignments.
• An approximation algorithm for channel assignment with certain constraints
• The Channel Assignment Problem with Variable Weights
• The channel assignment problem for mutually adjacent sites
• An Asymptotic Approach to the Channel Assignment Problem
• Capacity allocation with traditional and Internet channels

zbMATH Keywords

channel assignmentclique-boundsgraph imperfection

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Communication networks in operations research (90B18)

Cited In (4)

• Channel loading in private mobile radio networks
• Optimising channel assignments for private mobile radio networks in the UHF 2 band
• Title not available (Why is that?)
• Frequency-distance constraints with large distances

This page was built for publication: Channel assignment with large demands

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