New dominating sets in social networks

Authors:
Xu Zhu;Jieun Yu;Wonjun Lee;Donghyun Kim;Shan Shan;Ding-Zhu Du
Affiliations:
Department of Mathematics, Xi'an Jiaotong University, Xi'an, China;Department of Computer Science and Engineering, Korea University, Seoul, Republic of Korea;Department of Computer Science and Engineering, Korea University, Seoul, Republic of Korea;Department of Computer Science, University of Texas at Dallas, Richardson, USA 75080;Department of Computer Science, University of Texas at Dallas, Richardson, USA 75080;Department of Computer Science, University of Texas at Dallas, Richardson, USA 75080
Venue:
Journal of Global Optimization
Year:
2010

Citing 7
Cited 4

A special case for subset interconnection designs

Discrete Applied Mathematics
A threshold of ln n for approximating set cover

Journal of the ACM (JACM)
A greedy approximation for minimum connected dominating sets

Theoretical Computer Science
Analysis of greedy approximations with nonsubmodular potential functions

Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Maximizing a Submodular Set Function Subject to a Matroid Constraint (Extended Abstract)

IPCO '07 Proceedings of the 12th international conference on Integer Programming and Combinatorial Optimization
Latency-Bounded Minimum Influential Node Selection in Social Networks

WASA '09 Proceedings of the 4th International Conference on Wireless Algorithms, Systems, and Applications
Design and Analysis of Approximation Algorithms

Design and Analysis of Approximation Algorithms

Time-bounded essential localization for wireless sensor networks

IEEE/ACM Transactions on Networking (TON)
Modeling optimal social choice: matrix-vector representation of various solution concepts based on majority rule

Journal of Global Optimization
On the approximability of positive influence dominating set in social networks

Journal of Combinatorial Optimization
Dominating problems in swapped networks

Information Sciences: an International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

Motivated by applications in social networks, a new type of dominating set has been studied in the literature. In this paper, we present results regarding the complexity and approximation in general graphs.