Stochastic approximation algorithms for rumor source inference on graphs.
Anand KalvitVivek S. BorkarNikhil KaramchandaniPublished in: Perform. Evaluation (2019)
Keyphrases
- approximation algorithms
- undirected graph
- approximation schemes
- np hard
- special case
- minimum cost
- vertex cover
- worst case
- facility location problem
- primal dual
- network design problem
- probabilistic inference
- randomized algorithms
- spanning tree
- approximation guarantees
- constant factor
- open shop
- approximation ratio
- set cover
- polynomial time approximation
- scale free networks
- np hardness
- bayesian networks
- closest string
- learning algorithm
- disjoint paths
- complex networks
- social networks