On the Average Case Performance of Some Greedy Approximation Algorithms For the Uncapacitated Facility Location Problem.
Abraham D. FlaxmanAlan M. FriezeJuan Carlos VeraPublished in: Comb. Probab. Comput. (2007)
Keyphrases
- approximation algorithms
- average case
- worst case
- greedy algorithm
- np hard
- vertex cover
- greedy algorithms
- upper bound
- worst case analysis
- lower bound
- minimum cost
- search algorithm
- greedy heuristic
- approximation ratio
- computational complexity
- constant factor
- online algorithms
- average case complexity
- np hardness
- randomized algorithms
- disjoint paths
- primal dual
- undirected graph
- sample size
- randomized algorithm
- feature selection
- vc dimension
- uniform distribution
- dynamic programming
- polynomial time approximation
- search space
- constant factor approximation