The complexity of base station positioning in cellular networks
type: Item
instance of: scholarly article
title: The complexity of base station positioning in cellular networks
zbMATH Open document ID: 1099.90012
author: Christian Glaßer
author: S. Reith
author: Heribert Vollmer
published in: Discrete Applied Mathematics
publication date: 2005-05-04T00:00:00Z
Mathematics Subject Classification ID: 90B18
Mathematics Subject Classification ID: 90B80
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 2165425
zbMATH Keywords: Complexity
zbMATH Keywords: Approximation algorithms
zbMATH Keywords: PTAS
zbMATH Keywords: Demand Node
zbMATH Keywords: Traffic load model
MaRDI profile type: Publication
full work available at URL: j.dam.2004.07.005
OpenAlex ID: W2037456313
cites work: Q4258216
cites work: Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
cites work: Q4228484
cites work: Q4198056
cites work: Approximation schemes for covering and packing problems in image processing and VLSI
cites work: Optimum positioning of base stations for cellular radio networks
cites work: Q3221403
DOI: 10.1016/J.DAM.2004.07.005
description: scientific article; zbMATH DE number 2165425