Recommendations
- Approximation algorithm for partial positive influence problem in social network
- On positive influence dominating sets in social networks
- On the approximability of positive influence dominating set in social networks
- A general greedy approximation algorithm for finding minimum positive influence dominating sets in social networks
- Dual Domination
Cites work
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- A fast and effective heuristic for discovering small target sets in social networks
- A note on maximizing a submodular set function subject to a knapsack constraint
- Active influence spreading in social networks
- An analysis of the greedy algorithm for the submodular set covering problem
- Approximation algorithm for partial positive influence problem in social network
- Control and bribery in voting
- Dual Domination
- Evangelism in social networks: algorithms and complexity
- Fast and frugal targeting with incentives
- Generalized budgeted submodular set function maximization
- How hard is it to bribe the judges? A study of the complexity of bribery in judgment aggregation
- Influence Diffusion in Social Networks under Time Window Constraints
- Networks, crowds and markets. Reasoning about a highly connected world.
- On the approximability and exact algorithms for vector domination and related problems in graphs
- The computational difficulty of manipulating an election
Cited in
(5)
This page was built for publication: Pervasive domination
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6166909)
