Greedy algorithms for on-line set-covering and related problems.
Giorgio AusielloAristotelis GiannakosVangelis Th. PaschosPublished in: CATS (2006)
Keyphrases
- related problems
- set covering
- greedy algorithms
- greedy algorithm
- set covering problem
- integer programming
- range searching
- column generation
- search algorithm
- knapsack problem
- stable marriage
- structured databases
- broadly applicable
- integer program
- approximation ratio
- worst case
- combinatorial auctions
- similarity search
- np hard
- genetic algorithm