Cache Placement Phase Based on Graph Coloring
暂无分享,去创建一个
[1] Alexandros G. Dimakis,et al. Femtocaching and device-to-device collaboration: A new architecture for wireless video distribution , 2012, IEEE Communications Magazine.
[2] AliAkbar Tadaion,et al. A clustered caching placement in heterogeneous small cell networks with user mobility , 2015, 2015 IEEE International Symposium on Signal Processing and Information Technology (ISSPIT).
[3] Shahriar Lotfi,et al. Modified cuckoo optimization algorithm (MCOA) to solve graph coloring problem , 2015, Appl. Soft Comput..
[4] Urs Niesen,et al. Fundamental Limits of Caching , 2014, IEEE Trans. Inf. Theory.
[5] Isabel Méndez-Díaz,et al. Facets of the Graph Coloring Polytope , 2002, Ann. Oper. Res..
[6] David S. Johnson,et al. Some Simplified NP-Complete Graph Problems , 1976, Theor. Comput. Sci..
[7] David S. Johnson,et al. The Complexity of Near-Optimal Graph Coloring , 1976, J. ACM.
[8] Jun Li,et al. Distributed Caching for Data Dissemination in the Downlink of Heterogeneous Networks , 2015, IEEE Transactions on Communications.
[9] Deniz Gündüz,et al. Wireless Content Caching for Small Cell and D2D Networks , 2016, IEEE Journal on Selected Areas in Communications.
[10] Rui Zhang,et al. Cooperative Local Caching Under Heterogeneous File Preferences , 2015, IEEE Transactions on Communications.
[11] Jun Rao,et al. Optimal caching placement for D2D assisted wireless caching networks , 2015, 2016 IEEE International Conference on Communications (ICC).
[12] Alexandros G. Dimakis,et al. FemtoCaching: Wireless Content Delivery Through Distributed Caching Helpers , 2013, IEEE Transactions on Information Theory.
[13] Urs Niesen,et al. Decentralized coded caching attains order-optimal memory-rate tradeoff , 2013, 2013 51st Annual Allerton Conference on Communication, Control, and Computing (Allerton).