Tight lower bound for the channel assignment problem

DOI10.1145/2876505MaRDI QIDQ4962622zbMATH OpenOpenAlexFDO

Authors Arkadiusz Socała

Publication date 5 November 2018

Published in ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/2876505

zbMATH Keywords

channel assignmentexponential time hypothesislower bounds

Mathematics Subject Classification ID

Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Tight lower bound for the channel assignment problem
• Assigning channels via the meet-in-the-middle approach
• Assigning channels via the meet-in-the-middle approach
• An exact algorithm for the channel assignment problem
• Channel assignment via fast zeta transform

Cited in

(13)

• On the finite transmission zero assignment problem
• The channel assignment problem for mutually adjacent sites
• Optimal channel assignment and \(L(p,1)\)-labeling
• On the span in channel assignment problems: Bounds, computing and counting
• Channel assignment via fast zeta transform
• Fixed Parameter Complexity of Distance Constrained Labeling and Uniform Channel Assignment Problems
• Assigning channels via the meet-in-the-middle approach
• Channels With Cost Constraints: Strong Converse and Dispersion
• Assigning channels via the meet-in-the-middle approach
• A Theorem about the Channel Assignment Problem
• Tight lower bound for the channel assignment problem
• Approximation Algorithms for Minimum Span Channel Assignment Problems
• Algorithms and complexity of difference logic

This page was built for publication: Tight lower bound for the channel assignment problem

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