On a class of covering problems with variable capacities in wireless networks

DOI10.1007/978-3-319-04657-0_15MaRDI QIDQ5746253zbMATH OpenOpenAlexFDO

Authors Selim G. Akl, Robert Benkoczi, Daya Ram Gaur, Shahadat Hossain, Mark Thom, Hossam Hassanein

Publication date 18 February 2014

Published in Algorithms and Computation (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/1974/14033

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph theory (including graph drawing) in computer science (68R10) Randomized algorithms (68W20) Approximation algorithms (68W25) Discrete location and assignment (90B80)

Recommendations

• On a class of covering problems with variable capacities in wireless networks
• Coping with Interference: From Maximum Coverage to Planning Cellular Networks
• Distributed approximation of cellular coverage
• scientific article; zbMATH DE number 2089212
• Budget-constrained, capacitated hub location to maximize expected demand coverage in fixed-wireless telecommunication networks

Cited in

(7)

• Solving a minimum-power covering problem with overlap constraint for cellular network design
• On a class of covering problems with variable capacities in wireless networks
• On a coverage process ranging from the Boolean model to the Poisson-Voronoi tessellation with applications to wireless communications
• Cross line and column generation for the cut covering problem in wireless networks
• Budget-constrained, capacitated hub location to maximize expected demand coverage in fixed-wireless telecommunication networks
• Distributed approximation of cellular coverage
• Coping with Interference: From Maximum Coverage to Planning Cellular Networks

This page was built for publication: On a class of covering problems with variable capacities in wireless networks

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