Polynomial time approximation schemes for base station coverage with minimum total radii
type: Item
instance of: scholarly article
title: Polynomial time approximation schemes for base station coverage with minimum total radii
zbMATH Open document ID: 1079.68505
author: Nissan Lev-Tov
author: David Peleg
published in: Computer Networks
publication date: 2005-08-03T00:00:00Z
Mathematics Subject Classification ID: 68M10
Mathematics Subject Classification ID: 68U05
Mathematics Subject Classification ID: 68W25
zbMATH DE Number: 2191176
zbMATH Keywords: Wireless networks
zbMATH Keywords: Network design
zbMATH Keywords: Basestation placement
zbMATH Keywords: Disk covering
MaRDI profile type: MaRDI publication profile
full work available at URL: j.comnet.2004.08.012
OpenAlex ID: W1974383230
DOI: 10.1016/J.COMNET.2004.08.012
Recommended article: Q3046481
Recommended article: Polynomial time approximation schemes for minimum disk cover problems
Recommended article: Polynomial-time approximation schemes for piercing and covering with applications in wireless networks
Recommended article: Q3601572
Recommended article: A note on multicovering with disks
description: scientific article; zbMATH DE number 2191176