Interference in cellular networks: The minimum membership set cover problem

DOI10.1007/11533719_21MaRDI QIDQ5716937zbMATH OpenOpenAlexFDO

Authors Fabian Kuhn, Pascal von Rickenbach, Roger Wattenhofer, Aaron Zollinger, Emo Welzl

Publication date 11 January 2006

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

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

Mathematics Subject Classification ID

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

Recommendations

• Coping with Interference: From Maximum Coverage to Planning Cellular Networks
• Solving a minimum-power covering problem with overlap constraint for cellular network design
• On the complexity of minimizing interference in ad-hoc and sensor networks
• Min-max coverage in multi-interface networks
• Cellular network configuration with co-channel and adjacent-channel interference constraints
• Exact formulations for the minimum interference problem in \(k\)-connected \textit{ad hoc} wireless networks
• Constructing minimum-interference networks

Cited in

(21)

• Red-blue covering problems and the consecutive ones property
• Solving a minimum-power covering problem with overlap constraint for cellular network design
• Parameterized complexity of minimum membership dominating set
• Coping with Interference: From Maximum Coverage to Planning Cellular Networks
• Minimum Membership Set Covering and the Consecutive Ones Property
• Minimum membership covering and hitting
• Parameterized complexity of minimum membership dominating set
• Minimum ply covering of points with unit squares
• Improved algorithms for minimum-membership geometric set cover
• Exactly hittable interval graphs
• Approximation algorithms for minimum ply covering of points with unit squares and unit disks
• Minimum-membership geometric dominating set: complexity and algorithms
• Algorithms for minimum membership dominating set problem
• On sparse hitting sets: from fair vertex cover to highway dimension
• The checkpoint problem
• Kernels for below-upper-bound parameterizations of the hitting set and directed dominating set problems
• Maximum coverage in the data stream model: parameterized and generalized
• On the complexity of minimum membership dominating set
• Minimum ply covering of points with disks and squares
• Minimizing interference of a wireless ad-hoc network in a plane
• A kernelization algorithm for \(d\)-hitting set

This page was built for publication: Interference in cellular networks: The minimum membership set cover problem

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