Interference in cellular networks: the minimum membership set cover problem

Authors:
Fabian Kuhn;Pascal von Rickenbach;Roger Wattenhofer;Emo Welzl;Aaron Zollinger
Affiliations:
Computer Engineering and Networks Laboratory, ETH Zurich, Zurich, Switzerland;Computer Engineering and Networks Laboratory, ETH Zurich, Zurich, Switzerland;Computer Engineering and Networks Laboratory, ETH Zurich, Zurich, Switzerland;Department of Computer Science, ETH Zurich, Zurich, Switzerland;Computer Engineering and Networks Laboratory, ETH Zurich, Zurich, Switzerland
Venue:
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Year:
2005

Citing 9
Cited 11

Randomized rounding: a technique for provably good algorithms and algorithmic proofs

Combinatorica - Theory of Computing
Improved approximations of packing and covering problems

STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
A threshold of ln n for approximating set cover

Journal of the ACM (JACM)
On the hardness of approximating minimization problems

Journal of the ACM (JACM)
A deterministic approximation algorithm for a minmax integer programming problem

Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Channel assignment and graph multicoloring

Handbook of wireless networks and mobile computing
Channel assignment and graph labeling

Handbook of wireless networks and mobile computing
Conflict-Free Colorings of Simple Geometric Regions with Applications to Frequency Assignment in Cellular Networks

FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Approximation algorithms for combinatorial problems

Journal of Computer and System Sciences

Interference-constrained wireless coverage in a protocol model

Proceedings of the 9th ACM international symposium on Modeling analysis and simulation of wireless and mobile systems
Approximating geometric coverage problems

Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Minimizing interference of a wireless ad-hoc network in a plane

Theoretical Computer Science
Red-blue covering problems and the consecutive ones property

Journal of Discrete Algorithms
Linear kernelizations for restricted 3-Hitting Set problems

Information Processing Letters
A kernelization algorithm for d-Hitting Set

Journal of Computer and System Sciences
The checkpoint problem

APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Kernels for below-upper-bound parameterizations of the hitting set and directed dominating set problems

Theoretical Computer Science
Minimum membership set covering and the consecutive ones property

SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
The checkpoint problem

Theoretical Computer Science
Kernelization algorithms for d-hitting set problems

WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures

Quantified Score

Hi-index	0.00

Visualization

Abstract

The infrastructure for mobile distributed tasks is often formed by cellular networks. One of the major issues in such networks is interference. In this paper we tackle interference reduction by suitable assignment of transmission power levels to base stations. This task is formalized introducing the Minimum Membership Set Cover combinatorial optimization problem. On the one hand we prove that in polynomial time the optimal solution of the problem cannot be approximated more closely than with a factor ln n. On the other hand we present an algorithm exploiting linear programming relaxation techniques which asymptotically matches this lower bound.