On the approximability of positive influence dominating set in social networks
From MaRDI portal
(Redirected from Publication:2015789)
Recommendations
- On positive influence dominating sets in social networks
- A general greedy approximation algorithm for finding minimum positive influence dominating sets in social networks
- Rapid Influence Maximization on Social Networks: The Positive Influence Dominating Set Problem
- Approximation algorithm for partial positive influence problem in social network
- On the approximability of influence in social networks
- scientific article; zbMATH DE number 6501009
- Parameterized approximability of maximizing the spread of influence in networks
- Parameterized approximability of maximizing the spread of influence in networks
- Better approximation algorithms for influence maximization in online social networks
- Positive influence domination in graphs
Cites work
- A random graph model for massive graphs
- A threshold of ln n for approximating set cover
- Algorithms – ESA 2004
- Automata, Languages and Programming
- Community structure in social and biological networks
- Hardness, approximability, and exact algorithms for vector domination and total vector domination in graphs
- New dominating sets in social networks
- Non-approximability results for optimization problems on bounded degree instances
- On the hardness of optimization in power-law graphs
- Polynomial time approximation scheme for t-latency bounded information propagation problem in wireless networks
- Positive Influence Dominating Set in Online Social Networks
Cited in
(27)- Connected positive influence dominating set in \(k\)-regular graph
- Alliances in graphs of bounded clique-width
- Positive influence domination in graphs
- An ILP based memetic algorithm for finding minimum positive influence dominating sets in social networks
- Positive influence maximization in signed social networks under independent cascade model
- A general greedy approximation algorithm for finding minimum positive influence dominating sets in social networks
- A heuristic approximation algorithm of minimum dominating set based on rough set theory
- A compact mixed integer linear formulation for safe set problems
- Dual Domination
- A primal-dual algorithm for the minimum partial set multi-cover problem
- On the complexity of the vector connectivity problem
- Local ratio method on partial set multi-cover
- The connected critical node problem
- scientific article; zbMATH DE number 6501009 (Why is no real title available?)
- Positive Influence Dominating Set in Online Social Networks
- Computing an effective decision making group of a society using social network analysis
- Breaking thermaxBarrier: Enhanced Approximation Algorithms for Partial Set Multicover Problem
- Influence maximization with latency requirements on social networks
- Rapid Influence Maximization on Social Networks: The Positive Influence Dominating Set Problem
- Approximation algorithm for partial positive influence problem in social network
- On positive-influence target-domination
- An efficient local search algorithm for minimum positive influence dominating set problem
- Pervasive domination
- On positive influence dominating sets in social networks
- A hybrid population-based algorithm for solving the minimum dominating set problem
- Approximations for fault-tolerant total and partial positive influence domination
- An order-based algorithm for minimum dominating set with application in graph mining
This page was built for publication: On the approximability of positive influence dominating set in social networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2015789)
