On the complexity of optimal content placement in hierarchical caching networks

Simple item page
dc.contributor.authorPoularakis, Konstantinos
dc.contributor.authorTassiulas, Leandros
dc.date.accessioned2019-01-21T09:45:58Z
dc.date.available2019-01-21T09:45:58Z
dc.date.issued2016-06
dc.descriptionp.2092 - 2103en_US
dc.identifier.issn00906778
dc.identifier.urihttp://hdl.handle.net/123456789/7043
dc.language.isoenen_US
dc.relation.ispartofseriesin:IEEE transactions on Communications, Vol.64, n°5 (Mai 2016);
dc.subjectApproximation polynomialeen_US
dc.subjectInterneten_US
dc.subjectAlgorithmes d'approximationen_US
dc.titleOn the complexity of optimal content placement in hierarchical caching networksen_US
dc.typeArticleen_US

Files

Original bundle

Now showing 1 - 1 of 1
No Thumbnail Available
Name:
res.pdf
Size:
26.4 KB
Format:
Adobe Portable Document Format
Description:
Download

License bundle

Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description:
Download

Collections

Articles de périodique