Inapproximability of Dominating Set in Power Law Graphs
Mikael GastMathias HauptmannMarek KarpinskiPublished in: CoRR (2012)
Keyphrases
- power law
- dominating set
- connected dominating set
- facility location problem
- approximation algorithms
- small world
- real world graphs
- degree distribution
- power laws
- random graphs
- scale free
- power law distribution
- facility location
- clustering coefficient
- long range correlations
- np hard
- computational complexity
- path length
- worst case