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

Authors:
Wei Zhang;Zhao Zhang;Wei Wang;Feng Zou;Wonjun Lee
Affiliations:
College of Science, Xi'an Jiaotong University, Xi'an, P.R. China 710049;College of Mathematics and System Sciences, Xinjiang University, Urumqi, P.R. China 830046;College of Science, Xi'an Jiaotong University, Xi'an, P.R. China 710049;Department of Computer Science, University of Texas at Dallas, Richardson, USA 75083;Dept. of Computer Science and Engineering, Korea University, Seoul, Republic of Korea
Venue:
Journal of Combinatorial Optimization
Year:
2012

Citing 7
Cited 1

Mining the network value of customers

Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining
Intersection Graphs of Noncrossing Arc-Connected Sets in the Plane

GD '96 Proceedings of the Symposium on Graph Drawing
Maximizing the spread of influence through a social network

Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
On the submodularity of influence in social networks

Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Approximation algorithms for NP-complete problems on planar graphs

SFCS '83 Proceedings of the 24th Annual Symposium on Foundations of Computer Science
Latency-Bounded Minimum Influential Node Selection in Social Networks

WASA '09 Proceedings of the 4th International Conference on Wireless Algorithms, Systems, and Applications
Influential nodes in a diffusion model for social networks

ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming

On the approximability of positive influence dominating set in social networks

Journal of Combinatorial Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

Latency of information propagating in wireless network is gaining more and more attention recently. This paper studies the problem of t-Latency Bounded Information Propagation (t-LBIP) problem in wireless networks which are represented by unit-disk graphs. So far, no guaranteed approximation algorithm has been achieved for t-LBIP when t驴2. In this paper, we propose a Polynomial Time Approximation Scheme for t-LBIP under the condition that the maximum degree is bounded by a constant.