Efficient distributed approximation algorithms via probabilistic tree embeddings.
Maleq KhanFabian KuhnDahlia MalkhiGopal PanduranganKunal TalwarPublished in: PODC (2008)
Keyphrases
- approximation algorithms
- np hard
- special case
- minimum cost
- bayesian networks
- vertex cover
- primal dual
- worst case
- probabilistic model
- facility location problem
- open shop
- disjoint paths
- approximation schemes
- undirected graph
- genetic algorithm
- precedence constraints
- np hardness
- set cover
- approximation ratio
- polynomial time approximation
- search algorithm