Domination in graphs with bounded propagation: Algorithms, formulations and hardness results (Q987496)
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: Domination in graphs with bounded propagation: Algorithms, formulations and hardness results |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Domination in graphs with bounded propagation: Algorithms, formulations and hardness results |
scientific article |
Statements
Domination in graphs with bounded propagation: Algorithms, formulations and hardness results (English)
0 references
13 August 2010
0 references
dominating set
0 references
Ppower dominating set
0 references
planar graphs
0 references
approximation algorithms
0 references
PTAS
0 references
hardness of approximation
0 references
tree-width
0 references
integer programming
0 references
0.922875702381134
0 references
0.8956236839294434
0 references
0.8454703092575073
0 references
0.8405680060386658
0 references
0.8178462982177734
0 references
