Worst case analysis of a greedy algorithm for graph thickness.
Sinichiro KawanoKoichi YamazakiPublished in: Inf. Process. Lett. (2003)
Keyphrases
- greedy algorithm
- worst case analysis
- worst case
- greedy heuristic
- average case
- greedy algorithms
- upper bound
- np hard
- random walk
- objective function
- directed graph
- set cover
- approximation algorithms
- influence maximization
- sample size
- lower bound
- dynamic programming
- greedy strategy
- knapsack problem
- randomized algorithm
- influence spread
- np hardness
- graph mining
- bipartite graph
- linear program
- search algorithm