The minimum \(k\)-storage problem on directed graphs (Q2355709)
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: The minimum k-storage problem on directed graphs |
scientific article; zbMATH DE number 6464001
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The minimum \(k\)-storage problem on directed graphs |
scientific article; zbMATH DE number 6464001 |
Statements
The minimum \(k\)-storage problem on directed graphs (English)
0 references
24 July 2015
0 references
wireless sensor networks
0 references
storage placement
0 references
optimal algorithms
0 references
dynamic programming
0 references
0.9134784936904908
0 references
0.740066647529602
0 references
0.7381092309951782
0 references
0.7353408336639404
0 references
