{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T19:04:02Z","timestamp":1743015842549,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031183669"},{"type":"electronic","value":"9783031183676"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-18367-6_1","type":"book-chapter","created":{"date-parts":[[2022,10,20]],"date-time":"2022-10-20T16:05:36Z","timestamp":1666281936000},"page":"1-19","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Locating Service and\u00a0Charging Stations"],"prefix":"10.1007","author":[{"given":"Rajni","family":"Dabas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Naveen","family":"Garg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Neelima","family":"Gupta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dilpreet","family":"Kaur","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,10,21]]},"reference":[{"issue":"4","key":"1_CR1","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1287\/opre.43.4.623","volume":"43","author":"O Berman","year":"1995","unstructured":"Berman, O., Bertsimas, D., Larson, R.C.: Locating discretionary service facilities, II: maximizing market size, minimizing inconvenience. Oper. Res. 43(4), 623\u2013632 (1995)","journal-title":"Oper. Res."},{"issue":"3","key":"1_CR2","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1287\/trsc.26.3.201","volume":"26","author":"O Berman","year":"1992","unstructured":"Berman, O., Larson, R.C., Fouska, N.: Optimal location of discretionary service facilities. Transp. Sci. 26(3), 201\u2013211 (1992)","journal-title":"Transp. Sci."},{"key":"1_CR3","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1016\/j.jda.2015.05.013","volume":"34","author":"A Biniaz","year":"2015","unstructured":"Biniaz, A., Maheshwari, A., Smid, M.H.M.: On the hardness of full steiner tree problems. J. Discrete Algorithms 34, 118\u2013127 (2015)","journal-title":"J. Discrete Algorithms"},{"key":"1_CR4","doi-asserted-by":"crossref","unstructured":"Dinur, I., Steurer, D.: Analytical approach to parallel repetition. In: Proceedings of the Forty-Sixth Annual ACM Symposium on Theory of Computing, STOC 2014, pp. 624\u2013633. Association for Computing Machinery, New York (2014)","DOI":"10.1145\/2591796.2591884"},{"issue":"4","key":"1_CR5","doi-asserted-by":"publisher","first-page":"634","DOI":"10.1145\/285055.285059","volume":"45","author":"U Feige","year":"1998","unstructured":"Feige, U.: A threshold of ln n for approximating set cover. J. ACM 45(4), 634\u2013652 (1998)","journal-title":"J. ACM"},{"key":"1_CR6","doi-asserted-by":"publisher","first-page":"633","DOI":"10.1613\/jair.4688","volume":"53","author":"S Funke","year":"2015","unstructured":"Funke, S., Nusser, A., Storandt, S.: Placement of loading stations for electric vehicles: no detours necessary! J. Artif. Intell. Res. 53, 633\u2013658 (2015)","journal-title":"J. Artif. Intell. Res."},{"key":"1_CR7","doi-asserted-by":"crossref","unstructured":"Funke, S., Nusser, A., Storandt, S.: Placement of loading stations for electric vehicles: allowing small detours. In: Twenty-Sixth International Conference on Automated Planning and Scheduling (2016)","DOI":"10.1609\/icaps.v26i1.13748"},{"issue":"1","key":"1_CR8","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1006\/jagm.2000.1096","volume":"37","author":"N Garg","year":"2000","unstructured":"Garg, N., Konjevod, G., Ravi, R.: A polylogarithmic approximation algorithm for the group steiner tree problem. J. Algorithms 37(1), 66\u201384 (2000)","journal-title":"J. Algorithms"},{"issue":"2","key":"1_CR9","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1137\/S0097539793242618","volume":"24","author":"MX Goemans","year":"1995","unstructured":"Goemans, M.X., Williamson, D.P.: A general approximation technique for constrained forest problems. SIAM J. Comput. 24(2), 296\u2013317 (1995)","journal-title":"SIAM J. Comput."},{"key":"1_CR10","doi-asserted-by":"crossref","unstructured":"Halperin, E., Krauthgamer, R.: Polylogarithmic inapproximability. In: Proceedings of the Thirty-Fifth Annual ACM Symposium on Theory of Computing, STOC 2003, pp. 585\u2013594. Association for Computing Machinery, New York (2003)","DOI":"10.1145\/780542.780628"},{"issue":"2","key":"1_CR11","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 k-center problem. Math. Oper. Res. 10(2), 180\u2013184 (1985)","journal-title":"Math. Oper. Res."},{"issue":"3","key":"1_CR12","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1111\/j.1538-4632.1990.tb00210.x","volume":"22","author":"MJ Hodgson","year":"1990","unstructured":"Hodgson, M.J.: A flow-capturing location-allocation model. Geogr. Anal. 22(3), 270\u2013279 (1990)","journal-title":"Geogr. Anal."},{"issue":"4","key":"1_CR13","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1145\/347476.347479","volume":"47","author":"B Kalyanasundaram","year":"2000","unstructured":"Kalyanasundaram, B., Pruhs, K.: Speed is as powerful as clairvoyance. J. ACM (JACM) 47(4), 617\u2013643 (2000)","journal-title":"J. ACM (JACM)"},{"key":"1_CR14","first-page":"02","volume":"19","author":"P Klein","year":"2000","unstructured":"Klein, P., Ravi, R.: A nearly best-possible approximation algorithm for node-weighted steiner trees. J. Algorithms 19, 02 (2000)","journal-title":"J. Algorithms"},{"issue":"2","key":"1_CR15","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/j.seps.2004.03.001","volume":"39","author":"M Kuby","year":"2005","unstructured":"Kuby, M., Lim, S.: The flow-refueling location problem for alternative-fuel vehicles. Socioecon. Plann. Sci. 39(2), 125\u2013145 (2005)","journal-title":"Socioecon. Plann. Sci."},{"issue":"15","key":"1_CR16","doi-asserted-by":"publisher","first-page":"6045","DOI":"10.1016\/j.ijhydene.2009.05.050","volume":"34","author":"M Kuby","year":"2009","unstructured":"Kuby, M., Lines, L., Schultz, R., Xie, Z., Kim, J.-G., Lim, S.: Optimization of hydrogen stations in Florida using the flow-refueling location model. Int. J. Hydrogen Energy 34(15), 6045\u20136064 (2009)","journal-title":"Int. J. Hydrogen Energy"},{"key":"1_CR17","doi-asserted-by":"crossref","unstructured":"Mitra, S., et al.: Trajectory aware macro-cell planning for mobile users. In: 2015 IEEE Conference on Computer Communications (INFOCOM), pp. 792\u2013800. IEEE (2015)","DOI":"10.1109\/INFOCOM.2015.7218449"},{"key":"1_CR18","doi-asserted-by":"crossref","unstructured":"Mitra, S., Saraf, P., Sharma, R., Bhattacharya, A., Ranu, S., Bhandari, H.: Netclus: a scalable framework for locating top-k sites for placement of trajectory-aware services. In: 2017 IEEE 33rd International Conference on Data Engineering (ICDE), pp. 87\u201390. IEEE (2017)","DOI":"10.1109\/ICDE.2017.46"},{"key":"1_CR19","doi-asserted-by":"crossref","unstructured":"Naor, J., Panigrahi, D., Singh, M.: Online node-weighted steiner tree and related problems. In: Ostrovsky, R. (ed.) IEEE 52nd Annual Symposium on Foundations of Computer Science, FOCS 2011, Palm Springs, CA, USA, 22\u201325 October 2011, pp. 210\u2013219. IEEE Computer Society (2011)","DOI":"10.1109\/FOCS.2011.65"},{"key":"1_CR20","doi-asserted-by":"crossref","unstructured":"Storandt, S., Funke, S.: Enabling e-mobility: facility location for battery loading stations. In: Twenty-Seventh AAAI Conference on Artificial Intelligence (2013)","DOI":"10.1609\/aaai.v27i1.8478"}],"container-title":["Lecture Notes in Computer Science","Approximation and Online Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-18367-6_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,20]],"date-time":"2022-10-20T16:06:03Z","timestamp":1666281963000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-18367-6_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031183669","9783031183676"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-18367-6_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"21 October 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WAOA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Approximation and Online Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Potsdam","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":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"waoa2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/algo2022.eu\/waoa\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"21","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"12","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"57% - 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 (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}