Polynomial time approximation scheme for \(t\)-latency bounded information propagation problem in wireless networks
type: Item
instance of: scholarly article
title: Polynomial time approximation scheme for \(t\)-latency bounded information propagation problem in wireless networks
zbMATH Open document ID: 1245.90016
author: Wei Zhang
author: Zhao Zhang
author: Feng Zou
author: Wei Wang
author: Wonjun Lee
published in: Journal of Combinatorial Optimization
publication date: 2012-07-17T00:00:00Z
Mathematics Subject Classification ID: 90B18
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6057746
zbMATH Keywords: wireless network
zbMATH Keywords: information propagation
zbMATH Keywords: unit disk graph
zbMATH Keywords: polynomial time approximation scheme
MaRDI profile type: Publication
full work available at URL: s10878-010-9359-x
OpenAlex ID: W2042303061
cites work: A polynomial-time approximation scheme for the minimum-connected dominating set in ad hoc wireless networks
cites work: Q2941641
cites work: Automata, Languages and Programming
cites work: Q3549607
cites work: An analysis of approximations for maximizing submodular set functions—I
cites work: FAST INFORMATION PROPAGATION IN SOCIAL NETWORKS
DOI: 10.1007/S10878-010-9359-X
description: scientific article; zbMATH DE number 6057746