A two-phase greedy algorithm for modular lattice polyhedra.
Ulrich FaigleBritta PeisPublished in: CTW (2007)
Keyphrases
- greedy algorithm
- integer points
- greedy algorithms
- dynamic programming
- objective function
- knapsack problem
- worst case
- set cover
- approximation ratio
- approximation guarantees
- influence maximization
- greedy strategy
- special case
- greedy heuristic
- randomized algorithm
- permutation flowshop
- influence spread
- convex hull
- submodular functions