Randomized greedy: new variants of some classic approximation algorithms.
Kevin P. CostelloAsaf ShapiraPrasad TetaliPublished in: SODA (2011)
Keyphrases
- approximation algorithms
- randomized algorithms
- np hard
- greedy algorithm
- worst case
- special case
- vertex cover
- search algorithm
- network design problem
- minimum cost
- constant factor
- set cover
- facility location problem
- approximation ratio
- greedy heuristic
- greedy algorithms
- exact algorithms
- np hardness
- dynamic programming
- lower bound
- open shop
- disjoint paths
- primal dual
- undirected graph
- randomized algorithm
- search space
- learning algorithm
- active learning