{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,15]],"date-time":"2026-07-15T17:33:26Z","timestamp":1784136806807,"version":"3.55.0"},"reference-count":25,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,6,6]],"date-time":"2021-06-06T00:00:00Z","timestamp":1622937600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,6,6]],"date-time":"2021-06-06T00:00:00Z","timestamp":1622937600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,6,6]],"date-time":"2021-06-06T00:00:00Z","timestamp":1622937600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,6,6]]},"DOI":"10.1109\/icassp39728.2021.9413378","type":"proceedings-article","created":{"date-parts":[[2021,5,13]],"date-time":"2021-05-13T15:53:45Z","timestamp":1620921225000},"page":"4735-4739","source":"Crossref","is-referenced-by-count":8,"title":["An Efficient Linear Programming Rounding-and-Refinement Algorithm for Large-Scale Network Slicing Problem"],"prefix":"10.1109","author":[{"given":"Wei-Kun","family":"Chen","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ya-Feng","family":"Liu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yu-Hong","family":"Dai","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zhi-Quan","family":"Luo","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TNSM.2017.2711610"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2017.2760147"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2011.2159308"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/1592648.1592662"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TNSM.2018.2870733"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2012.6195719"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TNSM.2017.2723090"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/LANMAN.2015.7114738"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/INM.2015.7140281"},{"key":"ref19","article-title":"Gurobi optimizer reference manual","author":"optimization","year":"2019"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2020.3017628"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/SPAWC48557.2020.9154330"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/CloudNet.2015.7335301"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/IWQoS.2012.6245970"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2014.2312928"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2013.6566805"},{"key":"ref2","article-title":"Optimal network slicing for service-oriented networks with flexible routing and guaranteed E2E latency","author":"chen","year":"2020"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TNSM.2015.2459073"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2015.2477041"},{"key":"ref20","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-319-11008-0","author":"conforti","year":"2014","journal-title":"Integer Programming"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.17487\/RFC7665"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ICNP.2013.6733615"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2017.8278041"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1049\/cje.2018.05.008"},{"key":"ref25","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1007\/BF01580724","article-title":"A polynomial-time algorithm, based on Newton's method, for linear programming","volume":"40","author":"renegar","year":"1988","journal-title":"Mathematical Programming"}],"event":{"name":"ICASSP 2021 - 2021 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)","location":"Toronto, ON, Canada","start":{"date-parts":[[2021,6,6]]},"end":{"date-parts":[[2021,6,11]]}},"container-title":["ICASSP 2021 - 2021 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9413349\/9413350\/09413378.pdf?arnumber=9413378","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,3]],"date-time":"2023-11-03T14:30:08Z","timestamp":1699021808000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9413378\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,6]]},"references-count":25,"URL":"https:\/\/doi.org\/10.1109\/icassp39728.2021.9413378","relation":{},"subject":[],"published":{"date-parts":[[2021,6,6]]}}}