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

Proceedings of the 5th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications

Volumn , Issue , 2001, Pages 52-59

  Galota, Matthias ^a   Glaßer, Christian ^a   Reith, Steffen ^a   Vollmer, Heribert ^a  

^a UNIVERSITY OF WÜRZBURG   (Germany)

Author keywords

Approximation Algorithms; Network Design

Indexed keywords

APPROXIMATION THEORY; COSTS; MOBILE TELECOMMUNICATION SYSTEMS; POLYNOMIALS; TELECOMMUNICATION TRAFFIC;

BASE STATIONS;

TELECOMMUNICATION NETWORKS;

EID: 0035790407     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/381448.381455     Document Type: Conference Paper

References (16)

1. G. Ausiello, P. Crescenzi, G. Gambosi, V. Kann, A. Marchetti-Spaccamela, and M. Protasi. Complexity and Approximation - Combinatorial Optimization Problems and Their Approximability. Springer Verlag, Berlin Heidelberg, 1999.
2. P. Bose, C. Kaklamanis, L. Kirousis, E. Kranakis, D. Krizanic, and D. Peleg. Station layouts in the presence of location constraints. In Algorithms and Computation, 10th International Symposium, volume 1741 of Lecture Notes in Computer Science, pages 269-278, Berlin Heidelberg, 1999. Springer Verlag.
3. A. E. F. Clementi, P. Penna, and R. Silvestri. The power range assignment problem in radio networks on the plane. In Proceedings 17th Symposium on Theoretical Aspects of Computer Science, volume 1770 of Lecture Notes in Computer Science, pages 651-660, Berlin Heidelberg, 2000. Springer Verlag. See also Report No. 54 (2000) of the Electronic Colloqium on Computational Complexity.
4. S. Eidenbenz, C. Stamm, and P. Widmayer. Positioning guards at fixed height above a terrain - an optimum inapproximability result. In Algorithms ESA 98, volume 1461 of Lecture Notes in Computer Science, pages 187-198, Berlin Heidelberg, 1998. Springer Verlag.
5. R. J. Fowler, M. S. Paterson, and S. L. Tanimoto. Optimal packing and covering in the plane are NP-complete. Information Processing Letters, 12:133-137, 1981.
6. C. Glaßer, S. Reith, and H. Vollmer. The complexity of base station positioning in cellular networks. In Approximation and Randomized Algorithms in Communication Networks, ICALP Workshops 2000, volume 8 of Proceedings in Informatics, pages 167-177. Carleton Scientific, 2000.
7. D. Hochbaum and W. Maass. Approximation schemes for covering and packing problems in image processing and VLSI. Journal of the ACM, 32:130-136, 1985.
8. O. H. Ibarra and C. E. Kim. Fast approximation algorithms for the knapsack and sum of subset problems. Journal of the ACM, 22(4):463-468, 1975.
9. ITU-T Focus Group on Traffic Engineering for Personal Communication. E.750-Series of Recommendations on Traffic Engineering Aspects of Networks Supporting Mobile and UPT Services. Technical reference, The International Telecommunication Union, Geneva, CH, 1999.
10. M. R. Korupolu, C. G. Plaxton, and R. Rajaraman. Analysis of a local search heuristic for facility location problems. In Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 1-10, 1998.
11. A. Koster, C. van Hoesel, and W. Kolen. Optimal solutions for a frequency assignment problem via tree-decomposition. In Graph-Theoretic Concepts in Computer Science, volume 1665 of Lecture Notes in Computer Science, Berlin Heidelberg, 1999. Springer Verlag.
12. R. Mathar and T. Niessen. Optimum positioning of base stations for cellular radio networks. In Wireless Networks, 1999.
13. C. H. Papadimitriou. Computational Complexity. Addison-Wesley, Reading, MA, 1994.
14. T. S. Rappaport. Wireless Communications - Principles and Practice. Prentice Hall, Upper Saddle River, NJ, 1996.
15. K. Tutschku. Demand-based radio network planning of cellular communication systems. In Proceedings IEEE Infocom, San Francisco, CA, 1998.
16. K. Tutschku, K. Leibnitz, and P. Tran-Gia. ICEPT - an integrated cellular network planning tool. In Proceedings IEEE/VTS 47th Vehicular Technology Conference, Phoenix, AZ, 1997.