{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T04:47:24Z","timestamp":1726030044496},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030224813"},{"type":"electronic","value":"9783030224820"}],"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-3-030-22482-0_7","type":"book-chapter","created":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T06:02:46Z","timestamp":1559282566000},"page":"81-96","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Multi-Service Capacitated Facility Location Problem with Partial Covering in Smart Cities"],"prefix":"10.1007","author":[{"given":"Gerbrich","family":"Hoekstra","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frank","family":"Phillipson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,6,1]]},"reference":[{"key":"7_CR1","unstructured":"Charikar, M., Khuller, S., Mount, D., Narasimhan, G.: Algorithms for facility location problems with outliers. In: Proceedings of Symposium on Discrete Algorithms (SODA), pp. 642\u2013651 (2001)"},{"key":"7_CR2","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/BF01942293","volume":"32","author":"R Church","year":"1974","unstructured":"Church, R., ReVelle, C.: The maximal covering location problem. Pap. Reg. Sci. Assoc. 32, 101\u2013118 (1974)","journal-title":"Pap. Reg. Sci. Assoc."},{"key":"7_CR3","unstructured":"Fomin, F., Lokshtanov, D., Raman, V., Saurabh, S.: Subexponential algorithms for partial cover problems. In: FSTTCS, pp. 193\u2013201 (2009)"},{"issue":"1","key":"7_CR4","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/j.jalgor.2004.04.002","volume":"53","author":"R Gandhi","year":"2004","unstructured":"Gandhi, R., Khuller, S., Srinivasan, A.: Approximation algorithms for partial covering problems. J. Algorithms 53(1), 55\u201384 (2004)","journal-title":"J. Algorithms"},{"key":"7_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-03101-5","volume-title":"MSPN 2018","author":"G Hoekstra","year":"2018","unstructured":"Hoekstra, G., Phillipson, F.: Location assignment of capacitated services in smart cities. In: Renault, \u00c9., Boumerdassi, S., Bouzefrane, S. (eds.) MSPN 2018, vol. 11005. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-03101-5"},{"issue":"4","key":"7_CR6","doi-asserted-by":"publisher","first-page":"67","DOI":"10.3390\/computers7040067","volume":"7","author":"G Hoekstra","year":"2018","unstructured":"Hoekstra, G., Phillipson, F.: Heuristic approaches for location assignment of capacitated services in smart cities. Computers 7(4), 67 (2018)","journal-title":"Computers"},{"issue":"2","key":"7_CR7","doi-asserted-by":"publisher","first-page":"169","DOI":"10.5784\/29-2-137","volume":"29","author":"E Monabbati","year":"2003","unstructured":"Monabbati, E.: Uncapacitated facility location problem with self-serving demands. ORiON 29(2), 169\u2013180 (2003)","journal-title":"ORiON"},{"issue":"2","key":"7_CR8","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1016\/j.cor.2006.03.004","volume":"35","author":"Alan T. Murray","year":"2008","unstructured":"Murray, A.T., OKelly, M.E., Church, R.L.: Regional service coverage modelling. Comput. Oper. Res. 35(2), 339\u2013355 (2008)","journal-title":"Computers & Operations Research"},{"key":"7_CR9","doi-asserted-by":"crossref","unstructured":"Shi, Y., Zhang, Z., Du, D.Z.: Randomized bicriteria approximation algorithm for minimum submodular cost partial multi-cover problem. arXiv preprint arXiv:1701.05339 (2017)","DOI":"10.1007\/978-3-030-04618-7_6"},{"key":"7_CR10","doi-asserted-by":"crossref","unstructured":"Takazawa, Y., Mizuno, S., Kitahara, T.: An approximation algorithm for the partial covering 0-1 interger program (July 2017, revised)","DOI":"10.1016\/j.dam.2017.08.024"},{"issue":"1","key":"7_CR11","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1057\/palgrave.jors.2601469","volume":"54","author":"F Vasko","year":"2003","unstructured":"Vasko, F., Newhart, D., Stott, K., Wolf, F.: A large-scale application of the partial coverage uncapacitated facility location problem. J. Oper. Res. Soc. 54(1), 11\u201320 (2003)","journal-title":"J. Oper. Res. Soc."},{"key":"7_CR12","unstructured":"Verhoek, M.: Optimising the placement of access points for smart city services with stochastic demand. Master\u2019s thesis, Groningen University, the Netherlands (2017)"},{"key":"7_CR13","unstructured":"Vos, T., Phillipson, F.: Dense multi-service planning in smart cities. In: International Conference on Information Society and Smart Cities (2018)"},{"key":"7_CR14","unstructured":"Vos, T.: Using Lamppost to provide urban areas with multiple services. Master\u2019s thesis, Erasmus University, Rotterdam, the Netherlands (2016)"}],"container-title":["Communications in Computer and Information Science","Innovations for Community Services"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-22482-0_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,18]],"date-time":"2022-09-18T23:07:48Z","timestamp":1663542468000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-22482-0_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030224813","9783030224820"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-22482-0_7","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":"1 June 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"I4CS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Innovations for Community Services","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Wolfsburg","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 June 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 June 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"i4cs2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.i4cs-conference.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"43","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"16","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"37% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"3,33","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"5,96","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}