Approximating minimum cost source location problems with local vertex-connectivity demands (Q2434929)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6253986
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximating minimum cost source location problems with local vertex-connectivity demands |
scientific article; zbMATH DE number 6253986 |
Statements
Approximating minimum cost source location problems with local vertex-connectivity demands (English)
0 references
3 February 2014
0 references
iterative rounding
0 references
network design
0 references
source location problem
0 references
vertex-connectivity
0 references
0 references
0 references
0 references
1.0000001
0 references
0.9402226
0 references
0.9308793
0 references
0.92334735
0 references
0.9227653
0 references
0.91159916
0 references
0.89285165
0 references
0.8865268
0 references
0.8794114
0 references
