Approximation Algorithms for Minimum Span Channel Assignment Problems

DOI10.1007/11775096_31MaRDI QIDQ5434411zbMATH OpenOpenAlexFDO

Authors Yuichiro Miyamoto, Tomomi Matsui

Publication date 4 January 2008

Published in Algorithmic Aspects in Information and Management (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11775096_31

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Approximation algorithms for channel assignment with constraints
• scientific article; zbMATH DE number 1522941
• An approximation algorithm for channel assignment with certain constraints
• On the span in channel assignment problems: Bounds, computing and counting
• Approximation algorithms for channel allocation problems in broadcast networks
• Approximation algorithms for channel allocation problems in broadcast networks
• On the span of a random channel assignment problem
• Tight lower bound for the channel assignment problem
• Tight lower bound for the channel assignment problem
• An exact algorithm for the channel assignment problem

Cited in

(8)

• Channel assignment on graphs of bounded treewidth
• Combinatorial approximation algorithms for spectrum assignment problem in chain and ring networks
• An exact algorithm for the channel assignment problem
• On the span in channel assignment problems: Bounds, computing and counting
• Approximation algorithms for channel allocation problems in broadcast networks
• Approximation algorithms for channel allocation problems in broadcast networks
• Minimizing the span \(d\)-walks to compute optimum frequency assignments.
• Approximation algorithms for channel assignment with constraints

This page was built for publication: Approximation Algorithms for Minimum Span Channel Assignment Problems

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