New dominating sets in social networks

DOI10.1007/s10898-009-9511-2zbMath1226.90126OpenAlexW2058059841MaRDI QIDQ604953

Ding-Zhu Du, Donghyun Kim, Shan Shan, Jieun Yu, Xu Zhu, Won Jun Lee

Publication date: 12 November 2010

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

Full work available at URL: https://doi.org/10.1007/s10898-009-9511-2

zbMATH Keywords

dominating setsocial networkgreedy approximation

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Social networks; opinion dynamics (91D30)

Related Items (14)

Influence maximization problem: properties and algorithms ⋮ Dominating problems in swapped networks ⋮ Minimum edge blocker dominating set problem ⋮ An ILP based memetic algorithm for finding minimum positive influence dominating sets in social networks ⋮ Modeling optimal social choice: matrix-vector representation of various solution concepts based on majority rule ⋮ Influence Maximization with Latency Requirements on Social Networks ⋮ Rapid Influence Maximization on Social Networks: The Positive Influence Dominating Set Problem ⋮ A Note of Independent Number and Domination Number of Qn,k,m-Graph ⋮ A unified greedy approximation for several dominating set problems ⋮ Solving the multistage PMU placement problem by integer programming and equivalent network design model ⋮ Computing an effective decision making group of a society using social network analysis ⋮ Connected positive influence dominating set in \(k\)-regular graph ⋮ On the approximability of positive influence dominating set in social networks ⋮ Non-submodular maximization on massive data streams

Cites Work

• A greedy approximation for minimum connected dominating sets
• A special case for subset interconnection designs
• An analysis of the greedy algorithm for the submodular set covering problem
• A threshold of ln n for approximating set cover
• A BETTER APPROXIMATION FOR MINIMUM AVERAGE ROUTING PATH CLUSTERING PROBLEM IN 2-D UNDERWATER SENSOR NETWORKS
• A PTAS FOR MINIMUM d-HOP UNDERWATER SINK PLACEMENT PROBLEM IN 2-D UNDERWATER SENSOR NETWORKS
• ON THE PIPAGE ROUNDING ALGORITHM FOR SUBMODULAR FUNCTION MAXIMIZATION — A VIEW FROM DISCRETE CONVEX ANALYSIS
• MINIMUM CONNECTED r-HOP k-DOMINATING SET IN WIRELESS NETWORKS
• ANALYSIS ON THEORETICAL BOUNDS FOR APPROXIMATING DOMINATING SET PROBLEMS
• Maximizing a Submodular Set Function Subject to a Matroid Constraint (Extended Abstract)
• Unnamed Item
• Unnamed Item

This page was built for publication: New dominating sets in social networks