{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,10]],"date-time":"2026-03-10T14:53:44Z","timestamp":1773154424527,"version":"3.50.1"},"reference-count":14,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T00:00:00Z","timestamp":1748736000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Netw. Lett."],"published-print":{"date-parts":[[2025,6]]},"DOI":"10.1109\/lnet.2025.3541351","type":"journal-article","created":{"date-parts":[[2025,2,12]],"date-time":"2025-02-12T13:24:30Z","timestamp":1739366670000},"page":"135-139","source":"Crossref","is-referenced-by-count":4,"title":["Approximation Polynomial-Time Algorithms for Consistency-Aware Multi-Server Network Design in Delay-Sensitive Applications"],"prefix":"10.1109","volume":"7","author":[{"given":"Masaki","family":"Oda","sequence":"first","affiliation":[{"name":"Graduate School of Informatics, Kyoto University, Kyoto, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6254-2073","authenticated-orcid":false,"given":"Akio","family":"Kawabata","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering, Toyohashi University of Technology, Toyohashi, Aichi, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2177-5027","authenticated-orcid":false,"given":"Eiji","family":"Oki","sequence":"additional","affiliation":[{"name":"Graduate School of Informatics, Kyoto University, Kyoto, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","volume-title":"DOCOMO to offer Japan\u2019s fastest 5G SA service for downloads up to 6.6Gbps","year":"2024"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2017.2758803"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/NetGames.2014.7008957"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/s00530-014-0367-z"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/2831347.2831354"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2016.145"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ICC45041.2023.10279772"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.23919\/transcom.2023EBP3112"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-74875-7_4"},{"key":"ref10","volume-title":"Computer and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"ref11","volume-title":"Japan photonic network model","year":"2024"},{"key":"ref12","first-page":"11","article-title":"Results from the COST 239 project. Ultra-high capacity optical transmission networks","volume-title":"Proc. Eur. Conf. Opt. Commun.","author":"O\u2019Mahony"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2024.110504"},{"key":"ref14","volume-title":"IBM ILOG CPLEX","year":"2024"}],"container-title":["IEEE Networking Letters"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/8253410\/11038953\/10883039.pdf?arnumber=10883039","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,20]],"date-time":"2025-11-20T18:44:25Z","timestamp":1763664265000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10883039\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6]]},"references-count":14,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/lnet.2025.3541351","relation":{},"ISSN":["2576-3156"],"issn-type":[{"value":"2576-3156","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,6]]}}}