Reducing the diameter of a unit disk graph via node addition (Q2353655)
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: Reducing the diameter of a unit disk graph via node addition |
scientific article; zbMATH DE number 6458973
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Reducing the diameter of a unit disk graph via node addition |
scientific article; zbMATH DE number 6458973 |
Statements
Reducing the diameter of a unit disk graph via node addition (English)
0 references
15 July 2015
0 references
graph design optimization problem
0 references
approximation algorithms
0 references
graph algorithms
0 references
0 references
0 references
0.7470889687538147
0 references
0.7464874386787415
0 references
0.728662371635437
0 references
0.7166448831558228
0 references
0.7124408483505249
0 references
