Complexity of majority monopoly and signed domination problems (Q414422)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6033165
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity of majority monopoly and signed domination problems |
scientific article; zbMATH DE number 6033165 |
Statements
Complexity of majority monopoly and signed domination problems (English)
0 references
11 May 2012
0 references
approximation algorithms
0 references
dominating set
0 references
signed domination
0 references
0.8376299738883972
0 references
0.8133362531661987
0 references
0.8105713129043579
0 references
0.8105713129043579
0 references
