Polynomial time approximation scheme for \(t\)-latency bounded information propagation problem in wireless networks

DOI10.1007/s10878-010-9359-xzbMath1245.90016OpenAlexW2042303061MaRDI QIDQ437049

Zhao Zhang, Feng Zou, Wei Zhang, Wei Wang, Won Jun Lee

Publication date: 17 July 2012

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-010-9359-x

zbMATH Keywords

wireless networkunit disk graphpolynomial time approximation schemeinformation propagation

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (max. 100)

Approximation algorithm for partial positive influence problem in social network ⋮ On the approximability of positive influence dominating set in social networks

Cites Work

• FAST INFORMATION PROPAGATION IN SOCIAL NETWORKS
• An analysis of approximations for maximizing submodular set functions—I
• A polynomial-time approximation scheme for the minimum-connected dominating set in ad hoc wireless networks
• Automata, Languages and Programming
• Unnamed Item
• Unnamed Item

This page was built for publication: Polynomial time approximation scheme for \(t\)-latency bounded information propagation problem in wireless networks