Greedy Algorithm with Approximation Ratio for Sampling Noisy Graph Signals.
Changlong WuWenxin ChenJune ZhangPublished in: ICASSP (2018)
Keyphrases
- greedy algorithm
- approximation ratio
- greedy algorithms
- approximately optimal
- dynamic programming
- random walk
- greedy heuristic
- worst case
- set cover
- special case
- approximation guarantees
- directed graph
- knapsack problem
- influence spread
- greedy strategy
- approximation algorithms
- objective function
- bipartite graph
- np hard
- affinity graph
- connected components
- upper bound
- permutation flowshop
- evolutionary algorithm
- search algorithm
- optimal solution