{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:57:27Z","timestamp":1740099447708,"version":"3.37.3"},"publisher-location":"Singapore","reference-count":16,"publisher":"Springer Singapore","isbn-type":[{"type":"print","value":"9789811391897"},{"type":"electronic","value":"9789811391903"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","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":[[2019]]},"DOI":"10.1007\/978-981-13-9190-3_56","type":"book-chapter","created":{"date-parts":[[2019,7,10]],"date-time":"2019-07-10T13:02:55Z","timestamp":1562763775000},"page":"507-515","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The Multi-service Location Problems"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0540-7614","authenticated-orcid":false,"given":"Hung-I","family":"Yu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7238-3093","authenticated-orcid":false,"given":"Mong-Jen","family":"Kao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3894-5192","authenticated-orcid":false,"given":"D. T.","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,7,11]]},"reference":[{"key":"56_CR1","doi-asserted-by":"crossref","unstructured":"Ahmadian, S., Norouzi-Fard, A., Svensson, O., Ward, J.: Better guarantees for \n                    \n                      \n                    \n                    $$k$$\n                  -means and Euclidean \n                    \n                      \n                    \n                    $$k$$\n                  -median by primal-dual algorithms. In: 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS), pp. 61\u201372 (2017)","DOI":"10.1109\/FOCS.2017.15"},{"key":"56_CR2","unstructured":"Anzai, T., Ito, T., Suziki, A., Zhou, X.: The multi-service center decision problem is NP-complete for split graphs. In: Proceedings of the 6th World Congress on Engineering and Technology, CET 2016 (2016)"},{"issue":"2","key":"56_CR3","doi-asserted-by":"publisher","first-page":"23:1","DOI":"10.1145\/2981561","volume":"13","author":"J Byrka","year":"2017","unstructured":"Byrka, J., Pensyl, T., Rybicki, B., Srinivasan, A., Trinh, K.: An improved approximation for \n                    \n                      \n                    \n                    $$k$$\n                  -median and positive correlation in budgeted optimization. ACM Trans. Algorithms 13(2), 23:1\u201323:31 (2017)","journal-title":"ACM Trans. Algorithms"},{"key":"56_CR4","unstructured":"Charikar, M., Guha, S.: Improved combinatorial algorithms for the facility location and \n                    \n                      \n                    \n                    $$k$$\n                  -median problems. In: 40th Annual Symposium on Foundations of Computer Science, pp. 378\u2013388 (1999)"},{"key":"56_CR5","doi-asserted-by":"crossref","unstructured":"Feder, T., Greene, D.: Optimal algorithms for approximate clustering. In: Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, STOC 1988, pp. 434\u2013444. ACM, New York (1988)","DOI":"10.1145\/62212.62255"},{"issue":"2","key":"56_CR6","doi-asserted-by":"publisher","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                    \n                      \n                    \n                    $$k$$\n                  -center problem. Math. Oper. Res. 10(2), 180\u2013184 (1985)","journal-title":"Math. Oper. Res."},{"key":"56_CR7","unstructured":"Ito, T., Kakimura, N., Kobayashi, Y.: Complexity of the multi-service center problem. In: Okamoto, Y., Tokuyama, T. (eds.) 28th International Symposium on Algorithms and Computation (ISAAC 2017). Leibniz International Proceedings in Informatics (LIPIcs), vol. 92, pp. 48:1\u201348:12. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, Dagstuhl (2017)"},{"key":"56_CR8","doi-asserted-by":"crossref","unstructured":"Jain, K., Mahdian, M., Saberi, A.: A new greedy approach for facility location problems. In: Proceedings of the Thiry-fourth Annual ACM Symposium on Theory of Computing, STOC 2002, pp. 731\u2013740. ACM, New York (2002)","DOI":"10.1145\/510008.510012"},{"issue":"3","key":"56_CR9","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1137\/0137040","volume":"37","author":"O Kariv","year":"1979","unstructured":"Kariv, O., Hakimi, S.L.: An algorithmic approach to network location problems. I: The \n                    \n                      \n                    \n                    $$p$$\n                  -centers. SIAM J. Appl. Math. 37(3), 513\u2013538 (1979)","journal-title":"SIAM J. Appl. Math."},{"issue":"3","key":"56_CR10","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1137\/0137041","volume":"37","author":"O Kariv","year":"1979","unstructured":"Kariv, O., Hakimi, S.L.: An algorithmic approach to network location problems. II: The \n                    \n                      \n                    \n                    $$p$$\n                  -medians. SIAM J. Appl. Math. 37(3), 539\u2013560 (1979)","journal-title":"SIAM J. Appl. Math."},{"issue":"2","key":"56_CR11","doi-asserted-by":"publisher","first-page":"5:1","DOI":"10.1145\/1667053.1667054","volume":"57","author":"A Kumar","year":"2010","unstructured":"Kumar, A., Sabharwal, Y., Sen, S.: Linear-time approximation schemes for clustering problems in any dimensions. J. ACM 57(2), 5:1\u20135:32 (2010)","journal-title":"J. ACM"},{"issue":"1","key":"56_CR12","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1137\/0213014","volume":"13","author":"N Megiddo","year":"1984","unstructured":"Megiddo, N., Supowit, K.J.: On the complexity of some common geometric location problems. SIAM J. Comput. 13(1), 182\u2013196 (1984)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"56_CR13","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/0166-218X(87)90029-1","volume":"17","author":"J Plesn\u00edk","year":"1987","unstructured":"Plesn\u00edk, J.: A heuristic for the \n                    \n                      \n                    \n                    $$p$$\n                  -center problems in graphs. Discrete Appl. Math. 17(3), 263\u2013268 (1987)","journal-title":"Discrete Appl. Math."},{"issue":"2","key":"56_CR14","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/0167-6377(96)00021-1","volume":"19","author":"A Tamir","year":"1996","unstructured":"Tamir, A.: An \n                    \n                      \n                    \n                    $${O}(pn^2)$$\n                   algorithm for the \n                    \n                      \n                    \n                    $$p$$\n                  -median and related problems on tree graphs. Oper. Res. Lett. 19(2), 59\u201364 (1996)","journal-title":"Oper. Res. Lett."},{"key":"56_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"578","DOI":"10.1007\/978-3-642-35261-4_60","volume-title":"Algorithms and Computation","author":"H-I Yu","year":"2012","unstructured":"Yu, H.-I., Li, C.-C.: The multi-service center problem. In: Chao, K.-M., Hsu, T., Lee, D.-T. (eds.) ISAAC 2012. LNCS, vol. 7676, pp. 578\u2013587. Springer, Heidelberg (2012). \n                    https:\/\/doi.org\/10.1007\/978-3-642-35261-4_60"},{"key":"56_CR16","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1016\/j.tcs.2017.09.034","volume":"705","author":"HI Yu","year":"2018","unstructured":"Yu, H.I., Li, C.C., Lee, D.: The multi-service center problem. Theor. Comput. Sci. 705, 58\u201374 (2018)","journal-title":"Theor. Comput. Sci."}],"container-title":["Communications in Computer and Information Science","New Trends in Computer Technologies and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-13-9190-3_56","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,10]],"date-time":"2019-07-10T13:08:22Z","timestamp":1562764102000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-981-13-9190-3_56"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9789811391897","9789811391903"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-981-13-9190-3_56","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"11 July 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computer Symposium","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Yunlin","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Taiwan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 December 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 December 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"incosy2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/ics2018.yuntech.edu.tw\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}