Afficher la notice abrégée
dc.contributor.author |
Poularakis, Konstantinos |
|
dc.contributor.author |
Tassiulas, Leandros |
|
dc.date.accessioned |
2019-01-21T09:45:58Z |
|
dc.date.available |
2019-01-21T09:45:58Z |
|
dc.date.issued |
2016-06 |
|
dc.identifier.issn |
00906778 |
|
dc.identifier.uri |
http://hdl.handle.net/123456789/7043 |
|
dc.description |
p.2092 - 2103 |
en_US |
dc.language.iso |
en |
en_US |
dc.relation.ispartofseries |
in:IEEE transactions on Communications, Vol.64, n°5 (Mai 2016); |
|
dc.subject |
Approximation polynomiale |
en_US |
dc.subject |
Internet |
en_US |
dc.subject |
Algorithmes d'approximation |
en_US |
dc.title |
On the complexity of optimal content placement in hierarchical caching networks |
en_US |
dc.type |
Article |
en_US |
Fichier(s) constituant ce document
Ce document figure dans la(les) collection(s) suivante(s)
Afficher la notice abrégée