The complexity of base station positioning in cellular networks

Authors:
Christian Glaßer;Steffen Reith;Heribert Vollmer
Affiliations:
Theoretische Informatik, Universität Würzburg, Am Hubland, D-97074 Würzburg, Germany;Lengfelderstrasse 35b, 97078 Würzburg, Germany;Theoretische Informatik, Universität Hannover, Appelstr. 4, D-30167 Hannover, Germany
Venue:
Discrete Applied Mathematics
Year:
2005

Citing 9
Cited 2

Approximation schemes for covering and packing problems in image processing and VLSI

Journal of the ACM (JACM)
A threshold of ln n for approximating set cover (preliminary version)

STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Hardness of approximations

Approximation algorithms for NP-hard problems
Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems

Journal of the ACM (JACM)
Optimum positioning of base stations for cellular radio networks

Wireless Networks
A polynomial-time approximation scheme for base station positioning in UMTS networks

DIALM '01 Proceedings of the 5th international workshop on Discrete algorithms and methods for mobile computing and communications
Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties

Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Clique is hard to approximate within n1-

FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science

Approximating geometric coverage problems

Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Wireless LAN planning: a didactical model to optimise the cost and effective payback

International Journal of Mobile Network Design and Innovation

Quantified Score

Hi-index	0.04

Visualization

Abstract

We consider two optimization problems for cellular telephone networks, that arise in a recently discussed ITU proposal for a traffic load model. These problems address the positioning of base stations (on given possible locations) with the aim to maximize the number of supplied demand nodes and minimize the number of stations that have to be built. We show that these problems are hard to approximate, but their Euclidean versions allow a polynomial-time approximation scheme (PTAS). Furthermore, we consider other related optimization problems.