{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T20:01:03Z","timestamp":1730232063416,"version":"3.28.0"},"reference-count":18,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,5]]},"DOI":"10.1109\/icc.2018.8422839","type":"proceedings-article","created":{"date-parts":[[2018,8,20]],"date-time":"2018-08-20T22:51:41Z","timestamp":1534805501000},"page":"1-6","source":"Crossref","is-referenced-by-count":0,"title":["Pareto-Optimal Network Resource Deployment for Trade-Off between Number of Resources and Operation Risk"],"prefix":"10.1109","author":[{"given":"Kouichi","family":"Genda","sequence":"first","affiliation":[]},{"given":"Aki","family":"Fukuda","sequence":"additional","affiliation":[]},{"given":"Shohei","family":"Kamamura","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2005.846971"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2004.827446"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2009.12.090073"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/781027.781053"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/637201.637213"},{"year":"0","key":"ref15"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/50.387798"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/MASCOT.2001.948886"},{"year":"0","key":"ref18"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2007.343611"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2007.355"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2008.1082"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1997.0866"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2010.07.090219"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2007.105"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2002.1003042"},{"key":"ref1","first-page":"582","article-title":"Explicit routing algorithms for Internet traffic engineering","author":"wang","year":"1999","journal-title":"Proc IEEE International Conference on Computer Communications and Networks"},{"key":"ref9","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1109\/MAHC.1985.10011","article-title":"On the history of the minimum spanning tree problem","volume":"7","author":"hell","year":"1985","journal-title":"IEEE Annals of the History of Computing"}],"event":{"name":"2018 IEEE International Conference on Communications (ICC 2018)","start":{"date-parts":[[2018,5,20]]},"location":"Kansas City, MO","end":{"date-parts":[[2018,5,24]]}},"container-title":["2018 IEEE International Conference on Communications (ICC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8411665\/8422068\/08422839.pdf?arnumber=8422839","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,24]],"date-time":"2020-08-24T02:37:36Z","timestamp":1598236656000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8422839\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,5]]},"references-count":18,"URL":"https:\/\/doi.org\/10.1109\/icc.2018.8422839","relation":{},"subject":[],"published":{"date-parts":[[2018,5]]}}}