Online Matching in Sparse Random Graphs: Non-Asymptotic Performances of Greedy Algorithm.
Nathan NoiryFlore SentenacVianney PerchetPublished in: CoRR (2021)
Keyphrases
- greedy algorithm
- random graphs
- worst case
- greedy algorithms
- graph theoretic
- set cover
- structured sparsity
- greedy heuristic
- greedy strategy
- objective function
- dynamic programming
- influence spread
- phase transition
- knapsack problem
- computational complexity
- average case
- power law
- undirected graph
- online communities
- randomized algorithm
- influence maximization
- upper bound
- np hard