Efficient distributed approximation algorithms via probabilistic tree embeddings.
Maleq KhanFabian KuhnDahlia MalkhiGopal PanduranganKunal TalwarPublished in: Distributed Comput. (2012)
Keyphrases
- approximation algorithms
- np hard
- special case
- worst case
- vertex cover
- disjoint paths
- randomized algorithms
- facility location problem
- minimum cost
- np hardness
- bayesian networks
- approximation ratio
- approximation schemes
- open shop
- combinatorial auctions
- set cover
- approximation guarantees
- index structure
- graphical models