Inapproximability of dominating set on power law graphs (Q476891)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Inapproximability of dominating set on power law graphs |
scientific article; zbMATH DE number 6375994
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Inapproximability of dominating set on power law graphs |
scientific article; zbMATH DE number 6375994 |
Statements
Inapproximability of dominating set on power law graphs (English)
0 references
2 December 2014
0 references
approximation algorithms
0 references
inapproximability
0 references
power law graphs
0 references
combinatorial optimization
0 references
dominating set
0 references
0.8601535558700562
0 references
0.8374032378196716
0 references
0.8302656412124634
0 references
0.8241527676582336
0 references
0.8151079416275024
0 references
