New dominating sets in social networks
From MaRDI portal
Publication:604953
Recommendations
Cites work
- A BETTER APPROXIMATION FOR MINIMUM AVERAGE ROUTING PATH CLUSTERING PROBLEM IN 2-D UNDERWATER SENSOR NETWORKS
- A greedy approximation for minimum connected dominating sets
- A PTAS FOR MINIMUM d-HOP UNDERWATER SINK PLACEMENT PROBLEM IN 2-D UNDERWATER SENSOR NETWORKS
- A special case for subset interconnection designs
- A threshold of ln n for approximating set cover
- An analysis of the greedy algorithm for the submodular set covering problem
- ANALYSIS ON THEORETICAL BOUNDS FOR APPROXIMATING DOMINATING SET PROBLEMS
- scientific article; zbMATH DE number 5764849 (Why is no real title available?)
- scientific article; zbMATH DE number 1418967 (Why is no real title available?)
- Maximizing a Submodular Set Function Subject to a Matroid Constraint (Extended Abstract)
- MINIMUM CONNECTED r-HOP k-DOMINATING SET IN WIRELESS NETWORKS
- ON THE PIPAGE ROUNDING ALGORITHM FOR SUBMODULAR FUNCTION MAXIMIZATION — A VIEW FROM DISCRETE CONVEX ANALYSIS
Cited in
(19)- Dominating sets in social network graphs
- Connected positive influence dominating set in \(k\)-regular graph
- On the approximability of positive influence dominating set in social networks
- An ILP based memetic algorithm for finding minimum positive influence dominating sets in social networks
- Non-submodular maximization on massive data streams
- Modeling optimal social choice: matrix-vector representation of various solution concepts based on majority rule
- Solving the multistage PMU placement problem by integer programming and equivalent network design model
- Dominating problems in swapped networks
- Minimum edge blocker dominating set problem
- Computing an effective decision making group of a society using social network analysis
- A Dominating Set Based Approach to Identify Effective Leader Group of Social Network
- An Application of Arc-Reaching Sets in Social-Network Analysis
- 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 \(Q_{n, k, m}\)-graph
- A unified greedy approximation for several dominating set problems
- On positive influence dominating sets with bi-directional weighted constraint in social networks
- Approximations for fault-tolerant total and partial positive influence domination
- Influence maximization problem: properties and algorithms
This page was built for publication: New dominating sets in social networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q604953)