K-Connected Target Coverage Problem in Wireless Sensor Networks
type: Item
instance of: scholarly article
title: K-Connected Target Coverage Problem in Wireless Sensor Networks
zbMATH Open document ID: 1175.90090
DOI: 10.1007/978-3-540-73556-4_5
published in: Combinatorial Optimization and Applications
publication date: 2009-03-03T00:00:00Z
Mathematics Subject Classification ID: 90B18
Mathematics Subject Classification ID: 68M10
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 5522536
zbMATH Keywords: NP-hard problems
zbMATH Keywords: heuristic algorithms
zbMATH Keywords: \(k\)-connected target coverage
zbMATH Keywords: \(k\)-connected augmentation
zbMATH Keywords: wireless sensor networks
MaRDI profile type: Publication
full work available at URL: 978-3-540-73556-4 5
OpenAlex ID: W1508636908
Recommended article: Connected \(K\)-target coverage problem in wireless sensor networks with different observation scenarios
Recommended article: Parameterized complexity of max-lifetime target coverage in wireless sensor networks
Recommended article: Theoretical treatment of target coverage in wireless sensor networks
description: scientific article