A Simple Greedy Algorithm for Finding Functional Relations: Efficient Implementation and Average Case Anaylsis.
Tatsuya AkutsuSatoru MiyanoSatoru KuharaPublished in: Discovery Science (2000)
Keyphrases
- greedy algorithm
- efficient implementation
- average case
- worst case
- greedy algorithms
- worst case analysis
- upper bound
- greedy strategy
- uniform distribution
- active set
- knapsack problem
- dynamic programming
- lower bound
- objective function
- greedy heuristic
- approximation guarantees
- np hard
- approximation algorithms
- set cover
- influence maximization