{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,10]],"date-time":"2026-03-10T14:52:21Z","timestamp":1773154341055,"version":"3.50.1"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319748740","type":"print"},{"value":"9783319748757","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-74875-7_4","type":"book-chapter","created":{"date-parts":[[2018,1,27]],"date-time":"2018-01-27T01:42:30Z","timestamp":1517017350000},"page":"41-55","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Tight Approximability of the Server Allocation Problem for Real-Time Applications"],"prefix":"10.1007","author":[{"given":"Takehiro","family":"Ito","sequence":"first","affiliation":[]},{"given":"Naonori","family":"Kakimura","sequence":"additional","affiliation":[]},{"given":"Naoyuki","family":"Kamiyama","sequence":"additional","affiliation":[]},{"given":"Yusuke","family":"Kobayashi","sequence":"additional","affiliation":[]},{"given":"Yoshio","family":"Okamoto","sequence":"additional","affiliation":[]},{"given":"Taichi","family":"Shiitada","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,1,28]]},"reference":[{"issue":"1","key":"4_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejor.2007.06.008","volume":"190","author":"S Alumur","year":"2008","unstructured":"Alumur, S., Kara, B.Y.: Network hub location problems: the state of the art. Eur. J. Oper. Res. 190(1), 1\u201321 (2008)","journal-title":"Eur. J. Oper. Res."},{"key":"4_CR2","doi-asserted-by":"crossref","unstructured":"Ba, S., Kawabata, A., Chatterjee, B.C., Oki, E.: Computational time complexity of allocation problem for distributed servers in real-time applications. In: Proceedings of 18th Asia-Pacific Network Operations and Management Symposium, pp. 1\u20134 (2016)","DOI":"10.1109\/APNOMS.2016.7737236"},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"Byrka, J., Pensyl, T., Rybicki, B., Srinivasan, A., Trinh, K.: An improved approximation for \n            $$k$$\n          -median, and positive correlation in budgeted optimization. In: Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 737\u2013756 (2015)","DOI":"10.1137\/1.9781611973730.50"},{"issue":"2","key":"4_CR4","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1016\/0377-2217(94)90318-2","volume":"72","author":"JF Campbell","year":"1994","unstructured":"Campbell, J.F.: Integer programming formulations of discrete hub location problems. Eur. J. Oper. Res. 72(2), 387\u2013405 (1994)","journal-title":"Eur. J. Oper. Res."},{"key":"4_CR5","unstructured":"Chen, L.-H., Cheng, D.-W., Hsieh, S.-Y., Hung, L.-J., Lee, C.-W., Wu, B.Y.: Approximation algorithms for single allocation \n            $$k$$\n          -hub center problem. In: Proceedings of the 33rd Workshop on Combinatorial Mathematics and Computation Theory (CMCT 2016), pp. 13\u201318 (2016)"},{"issue":"4","key":"4_CR6","doi-asserted-by":"crossref","first-page":"1096","DOI":"10.1016\/j.cie.2013.01.012","volume":"64","author":"RZ Farahani","year":"2013","unstructured":"Farahani, R.Z., Hekmatfar, M., Arabani, A.B., Nikbakhsh, E.: Hub location problems: a review of models, classification, solution techniques, and applications. Comput. Ind. Eng. 64(4), 1096\u20131109 (2013)","journal-title":"Comput. Ind. Eng."},{"key":"4_CR7","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/0304-3975(85)90224-5","volume":"38","author":"TF Gonzalez","year":"1985","unstructured":"Gonzalez, T.F.: Clustering to minimize the maximum intercluster distance. Theor. Comput. Sci. 38, 293\u2013306 (1985)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"4_CR8","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1287\/moor.10.2.180","volume":"10","author":"DS Hochbaum","year":"1985","unstructured":"Hochbaum, D.S., Shmoys, D.B.: A best possible heuristic for the \n            $$k$$\n          -center problem. Math. Oper. Res. 10(2), 180\u2013184 (1985)","journal-title":"Math. Oper. Res."},{"issue":"2","key":"4_CR9","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1006\/jcss.2000.1727","volume":"62","author":"R Impagliazzo","year":"2001","unstructured":"Impagliazzo, R., Paturi, R.: On the complexity of \n            $$k$$\n          -SAT. J. Comput. Syst. Sci. 62(2), 367\u2013375 (2001)","journal-title":"J. Comput. Syst. Sci."},{"issue":"4","key":"4_CR10","doi-asserted-by":"crossref","first-page":"512","DOI":"10.1006\/jcss.2001.1774","volume":"63","author":"R Impagliazzo","year":"2001","unstructured":"Impagliazzo, R., Paturi, R., Zane, F.: Which problems have strongly exponential complexity? J. Comput. Syst. Sci. 63(4), 512\u2013530 (2001)","journal-title":"J. Comput. Syst. Sci."},{"key":"4_CR11","doi-asserted-by":"crossref","unstructured":"Kawabata, A., Chatterjee, B.C., Oki, E.: Distributed processing communication scheme for real-time applications considering admissible delay. In: Proceedings of 2016 IEEE International Workshop Technical Committee on Communications Quality and Reliability, pp. 1\u20136 (2016)","DOI":"10.1109\/CQR.2016.7501414"},{"issue":"4","key":"4_CR12","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1007\/BF01434594","volume":"70","author":"ME O\u2019Kelly","year":"1991","unstructured":"O\u2019Kelly, M.E., Miller, H.J.: Solution strategies for the single facility minimax hub location problem. Pap. Reg. Sci. 70(4), 367\u2013380 (1991)","journal-title":"Pap. Reg. Sci."}],"container-title":["Lecture Notes in Computer Science","Algorithmic Aspects of Cloud Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-74875-7_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,1,27]],"date-time":"2018-01-27T01:44:21Z","timestamp":1517017461000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-74875-7_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319748740","9783319748757"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-74875-7_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]}}}