Greedy construction of 2-approximate minimum Manhattan networks (Q3089095)
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: Greedy construction of 2-approximate minimum Manhattan networks |
scientific article; zbMATH DE number 5942020
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Greedy construction of 2-approximate minimum Manhattan networks |
scientific article; zbMATH DE number 5942020 |
Statements
GREEDY CONSTRUCTION OF 2-APPROXIMATE MINIMUM MANHATTAN NETWORKS (English)
0 references
23 August 2011
0 references
minimum manhattan networks
0 references
approximation algorithms
0 references
greedy strategy
0 references
0.992488443851471
0 references
0.941889464855194
0 references
0.8957833647727966
0 references
0.8812043070793152
0 references
