A Generic Greedy Algorithm, Partially-Ordered Graphs and NP-Completeness.
Antonio PuricellaIain A. StewartPublished in: WG (2001)
Keyphrases
- greedy algorithm
- partially ordered
- partial order
- greedy algorithms
- greedy approximation algorithm
- partial ordering
- totally ordered
- knapsack problem
- worst case
- dynamic programming
- greedy strategy
- objective function
- approximation guarantees
- greedy heuristic
- set cover
- influence spread
- influence maximization
- directed graph
- data structure
- submodular functions
- search algorithm
- total ordering
- randomized algorithm
- permutation flowshop