Efficient Polling Algorithms using Friendship Paradox and Blackwell Dominance.
Sujay BhattBuddhika NettasingheVikram KrishnamurthyPublished in: FUSION (2019)
Keyphrases
- computationally intensive
- theoretical analysis
- computationally efficient
- neural network
- highly efficient
- computationally expensive
- social network analysis
- pruning strategy
- computational complexity
- algorithmic solutions
- worst case
- orders of magnitude
- significant improvement
- highly scalable
- efficient implementation
- single pass
- computationally complex
- social influence
- combinatorial optimization
- computational cost
- social networks
- genetic algorithm