Abstract
Purchase PDF (204 K)
E-mail Article
Add to my Quick Links
Cited By in Scopus (3)
Purchase PDF (740 K)
doi:10.1016/j.dam.2004.07.005 
Copyright © 2004 Published by Elsevier B.V.
References and further reading may be available for this article. To view references and further reading you must purchase this article.
Christian Glaßera, 1, 
, Steffen Reithb, 1, , and Heribert Vollmerc, 1,
Received 13 July 2003;
revised 27 June 2004;
accepted 7 July 2004.
Available online 16 February 2005.
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.
Keywords: Complexity; Approximation algorithms; PTAS; Demand Node; Traffic load model
Article Outline
- 1. Introduction
- 1.1. Maximize number of totally supplied nodes (MAX-TSN) [10]
- 1.2. Minimize number of base stations (MIN-BS)
- 2. Non-approximability results
- 3. A polynomial-time approximation scheme for MAX-ETSN
- 4. Approximating MIN-EBS in polynomial time
- 5. Optimizing networks without interferences
- 6. Conclusion
- Acknowledgements
- References
