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

  • Authors:

  • Matthias Galota;Christian Glaßer;Steffen Reith;Heribert Vollmer

  • Affiliations:

  • Theoretische Informatik, Universität Würzburg, Am Hubland, D-97074 Wärzburg, Germany;Theoretische Informatik, Universität Würzburg, Am Hubland, D-97074 Wärzburg, Germany;Theoretische Informatik, Universität Würzburg, Am Hubland, D-97074 Wärzburg, Germany;Theoretische Informatik, Universität Würzburg, Am Hubland, D-97074 Wärzburg, Germany

  • Venue:
  • DIALM '01 Proceedings of the 5th international workshop on Discrete algorithms and methods for mobile computing and communications
  • Year:
  • 2001

Quantified Score

Hi-index 0.00

Visualization

Abstract

We consider the following optimization problem for UMTS networks: For a specified teletraffic demand and possible base station locations, choose positions for base stations such thatthe construction costs are below a given limit,as much teletraffic as possible is supplied,the ongoing costs are minimal, andthe intra-cell interference in the range of each base station is low.We prove that for a particular specification of teletraffic (the so called demand node concept), this problem has a polynomial-time approximation scheme, but cannot have a fully polynomial-time approximation scheme unless P = NP.