Efficient approximation algorithms to determine minimum partial dominating sets in social networks.
Alina CampanTraian Marius TrutaMatthew BeckerichPublished in: IEEE BigData (2015)
Keyphrases
- approximation algorithms
- social networks
- minimum cost
- constant factor
- np hard
- special case
- vertex cover
- worst case
- primal dual
- facility location problem
- approximation schemes
- network design problem
- np hardness
- set cover
- randomized algorithms
- social network analysis
- combinatorial auctions
- scheduling problem
- open shop
- closest string
- approximation ratio
- precedence constraints
- exact algorithms