Greedy algorithm for stochastic matching is a 2-approximation
Marek AdamczykPublished in: CoRR (2010)
Keyphrases
- greedy algorithm
- approximation ratio
- influence spread
- approximation guarantees
- submodular functions
- greedy algorithms
- randomized algorithm
- worst case
- greedy strategy
- dynamic programming
- objective function
- set cover
- approximation algorithms
- greedy heuristic
- knapsack problem
- influence maximization
- greedy approximation algorithm
- special case
- web pages