{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,3]],"date-time":"2026-08-03T18:44:57Z","timestamp":1785782697821,"version":"3.56.0"},"reference-count":33,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"5","license":[{"start":{"date-parts":[[2016,5,1]],"date-time":"2016-05-01T00:00:00Z","timestamp":1462060800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/501100000780","name":"European Commission Horizon 2020 Research Programme","doi-asserted-by":"publisher","award":["671551"],"award-info":[{"award-number":["671551"]}],"id":[{"id":"10.13039\/501100000780","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Commun."],"published-print":{"date-parts":[[2016,5]]},"DOI":"10.1109\/tcomm.2016.2545655","type":"journal-article","created":{"date-parts":[[2016,3,23]],"date-time":"2016-03-23T14:17:13Z","timestamp":1458742633000},"page":"2092-2103","source":"Crossref","is-referenced-by-count":54,"title":["On the Complexity of Optimal Content Placement in Hierarchical Caching Networks"],"prefix":"10.1109","volume":"64","author":[{"given":"Konstantinos","family":"Poularakis","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Leandros","family":"Tassiulas","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/CISS.2012.6310774"},{"key":"ref32","first-page":"1282","article-title":"On the optimal placement of Web proxies in the Internet","author":"li","year":"0","journal-title":"Proc INFOCOM"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/2413176.2413193"},{"key":"ref30","doi-asserted-by":"crossref","first-page":"566","DOI":"10.1109\/TNET.2012.2208199","article-title":"Optimal content placement for peer-to-peer video-on-demand systems","volume":"21","author":"tan","year":"2013","journal-title":"IEEE\/ACM Trans Netw"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1287\/moor.3.3.177"},{"key":"ref11","first-page":"661","article-title":"Approximation algorithms for data placement in arbitrary networks","author":"baev","year":"0","journal-title":"Proc 9th ACM\/SIAM Symp Discr Algorithms (SODA)"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1137\/080715421"},{"key":"ref13","volume":"24","author":"schrijver","year":"2003","journal-title":"Combinatorial Optimization Polyhedra and Efficiency"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2014.2351796"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2014.6871674"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2015.7248843"},{"key":"ref17","year":"2016","journal-title":"MOSEK Optimization Software"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-68279-0_3"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2012.66"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2013.03.025"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2009.5198800"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2004.07.020"},{"key":"ref3","first-page":"2444","article-title":"Collaborative hierarchical caching with dynamic request routing for massive content distribution","author":"dai","year":"0","journal-title":"Proc IEEE InfoCom"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/71.250099"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2011.5935123"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.2000.1129"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2012.6195469"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2010.5461964"},{"key":"ref2","author":"mccallum","year":"2015","journal-title":"Disk Drive Prices (1955-2014)"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45077-1_4"},{"key":"ref1","year":"2015","journal-title":"Visual Networking Index"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2015.7218465"},{"key":"ref22","first-page":"1812","article-title":"Lazier than lazy greedy","author":"mirzasoleiman","year":"0","journal-title":"Proc Nat Conf Artif Intell (AAAI)"},{"key":"ref21","author":"goundan","year":"2009","journal-title":"Revisiting the greedy approach to submodular set function maximization"},{"key":"ref24","author":"poularakis","year":"2016","journal-title":"Publicly Available Code"},{"key":"ref23","first-page":"15","article-title":"YouTube traffc characterization: A view from the edge","author":"gill","year":"0","journal-title":"Proc ACM Sigcomm"},{"key":"ref26","first-page":"1587","article-title":"On the placement of web server replicas","volume":"3","author":"qiu","year":"0","journal-title":"Proc IEEE InfoCom"},{"key":"ref25","first-page":"406","article-title":"A collaborative framework for in-network video caching in mobile networks","author":"he","year":"0","journal-title":"Proc IEEE Conf Sensor Mesh Ad Hoc Commun Netw (SECON)"}],"container-title":["IEEE Transactions on Communications"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/26\/7469911\/07439797.pdf?arnumber=7439797","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T11:43:39Z","timestamp":1641987819000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7439797\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,5]]},"references-count":33,"journal-issue":{"issue":"5"},"URL":"https:\/\/doi.org\/10.1109\/tcomm.2016.2545655","relation":{},"ISSN":["0090-6778"],"issn-type":[{"value":"0090-6778","type":"print"}],"subject":[],"published":{"date-parts":[[2016,5]]}}}