Assignment problem in content distribution networks, unsplittable hard-capacitated facility location (Q3189061)
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 6341932
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Assignment problem in content distribution networks, unsplittable hard-capacitated facility location |
scientific article; zbMATH DE number 6341932 |
Statements
Assignment problem in content distribution networks (English)
0 references
9 September 2014
0 references
approximation algorithm
0 references
PTAS
0 references
facility location
0 references
network
0 references
0.9914696216583252
0 references
0.809784471988678
0 references
0.776413083076477
0 references
0.7745984792709351
0 references
0.7732596397399902
0 references
