A rounding algorithm for approximating minimum Manhattan networks (Q2474072)
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: A rounding algorithm for approximating minimum Manhattan networks |
scientific article; zbMATH DE number 5242691
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A rounding algorithm for approximating minimum Manhattan networks |
scientific article; zbMATH DE number 5242691 |
Statements
A rounding algorithm for approximating minimum Manhattan networks (English)
0 references
5 March 2008
0 references
\(l_1\)-distance
0 references
network design
0 references
linear programming
0 references
approximation algorithms
0 references
0.9930656552314758
0 references
0.889105498790741
0 references
0.8863390684127808
0 references
0.878716766834259
0 references
