Min-Cut Based Partitioning for Urban LTE Cell Site Planning


A. Engels, M. Reyer, A. Steiger, R. Mathar,


        Common approaches for partitioning cell site planning problems into smaller instances typically suffer from the
lack of knowledge about the number of clusters k that is appropriate for the particular problem. When applying an iterative processing over methods such as the k-means algorithm or the related k-medoids approach to determine the optimum k, the computational effort can be higher than solving the original problem instance directly. This is particularly the case if the optimum k is small, which happens most likely in urban environments where the user density and the number of cells are high.
In this paper, we propose a graph-based method using minimum cut operations to partition a planning instance automatically into an appropriate number of k sub-problems. We demonstrate the benefits of this approach by numerical evaluation of exemplary application to the problem of planning LTE cell site locations in an urban environment.

BibTEX Reference Entry 

	author = {Alexander Engels and Michael Reyer and Andreas Steiger and Rudolf Mathar},
	title = "Min-Cut Based Partitioning for Urban LTE Cell Site Planning",
	pages = "500-505",
	booktitle = "The  10th {IEEE} Consumer Communications {\&} Networking Conference CCNC 2013",
	address = {Las Vegas, Nevada USA},
	month = Jan,
	year = 2013,
	hsb = hsb999910282145,


 Download paper  Download bibtex-file

This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights there in are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.