Approximation Algorithms and Hardness for Domination with Propagation (Q5901134)
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 5775361
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximation Algorithms and Hardness for Domination with Propagation |
scientific article; zbMATH DE number 5775361 |
Statements
Approximation Algorithms and Hardness for Domination with Propagation (English)
0 references
27 August 2010
0 references
dominating set
0 references
power dominating set
0 references
PMU placement problem
0 references
approximation algorithms
0 references
hardness of approximation
0 references
tree-width
0 references
planar graphs
0 references
greedy algorithms
0 references
0.9999999
0 references
0.95032036
0 references
0.9288996
0 references
0.9109776
0 references
0.9109776
0 references
0.9106958
0 references
0.9104297
0 references
0.9085422
0 references
