On the average case performance of some greedy approximation algorithms for the uncapacitated facility location problem.
Abraham FlaxmanAlan M. FriezeJuan Carlos VeraPublished in: STOC (2005)
Keyphrases
- approximation algorithms
- average case
- worst case
- greedy algorithm
- np hard
- worst case analysis
- lower bound
- greedy algorithms
- upper bound
- greedy heuristic
- search algorithm
- competitive ratio
- constant factor
- minimum cost
- vertex cover
- sample size
- approximation ratio
- np hardness
- special case
- randomized algorithms
- primal dual
- vc dimension
- disjoint paths
- undirected graph
- dynamic programming
- optimal solution
- constant factor approximation
- feature selection
- online algorithms
- uniform distribution
- knapsack problem
- theoretical analysis
- scheduling problem
- support vector