{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T14:22:52Z","timestamp":1743085372468,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319988085"},{"type":"electronic","value":"9783319988092"}],"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-98809-2_28","type":"book-chapter","created":{"date-parts":[[2018,8,8]],"date-time":"2018-08-08T08:19:34Z","timestamp":1533716374000},"page":"457-475","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Load Balancing in Network Voronoi Diagrams Under Overload Penalties"],"prefix":"10.1007","author":[{"given":"Ankita","family":"Mehta","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kapish","family":"Malik","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Venkata M. V.","family":"Gunturi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anurag","family":"Goel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pooja","family":"Sethia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aditi","family":"Aggarwal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,8,9]]},"reference":[{"key":"28_CR1","unstructured":"Wikipedia: Catchment area. http:\/\/en.wikipedia.org\/w\/index.php?title=Catchment%20area"},{"issue":"9","key":"28_CR2","first-page":"965","volume":"22","author":"A Okabe","year":"2008","unstructured":"Okabe, A., et al.: Generalized network voronoi diagrams: concepts, computational methods, and applications. Int. J. GIS 22(9), 965\u2013994 (2008)","journal-title":"Int. J. GIS"},{"key":"28_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"526","DOI":"10.1007\/978-3-642-29038-1_38","volume-title":"Database Systems for Advanced Applications","author":"U Demiryurek","year":"2012","unstructured":"Demiryurek, U., Shahabi, C.: Indexing network voronoi diagrams. In: Lee, S., Peng, Z., Zhou, X., Moon, Y.-S., Unland, R., Yoo, J. (eds.) DASFAA 2012. LNCS, vol. 7238, pp. 526\u2013543. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29038-1_38"},{"issue":"11","key":"28_CR4","doi-asserted-by":"publisher","first-page":"2919","DOI":"10.1109\/TKDE.2015.2445756","volume":"27","author":"K Yang","year":"2015","unstructured":"Yang, K., et al.: Capacity-constrained network-voronoi diagram. IEEE Trans. Knowl. Data Eng. 27(11), 2919\u20132932 (2015)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"28_CR5","doi-asserted-by":"crossref","unstructured":"U, L.H., et al.: Optimal matching between spatial datasets under capacity constraints. ACM Trans. Database Syst. 35(2), 9:1\u20139: 44 (2010)","DOI":"10.1145\/1735886.1735888"},{"key":"28_CR6","doi-asserted-by":"crossref","unstructured":"U, L.H., et al.: Capacity constrained assignment in spatial databases. In: Proceeding of the International Conference on Management of Data (SIGMOD), pp. 15\u201328 (2008)","DOI":"10.1145\/1376616.1376621"},{"issue":"1","key":"28_CR7","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1137\/0216006","volume":"16","author":"F Aurenhammer","year":"1987","unstructured":"Aurenhammer, F.: Power diagrams: properties, algorithms and applications. SIAM J. Comput. 16(1), 78\u201396 (1987)","journal-title":"SIAM J. Comput."},{"issue":"5","key":"28_CR8","doi-asserted-by":"publisher","first-page":"697","DOI":"10.1007\/s00778-013-0347-5","volume":"23","author":"B Yao","year":"2014","unstructured":"Yao, B., et al.: Dynamic monitoring of optimal locations in road network databases. VLDB J. 23(5), 697\u2013720 (2014)","journal-title":"VLDB J."},{"key":"28_CR9","doi-asserted-by":"crossref","unstructured":"Xiao, X., Yao, B., Li, F.: Optimal location queries in road network databases. In: Proceedings of the 27th International Conference on Data Engineering (ICDE), pp. 804\u2013815 (2011)","DOI":"10.1109\/ICDE.2011.5767845"},{"issue":"7","key":"28_CR10","doi-asserted-by":"publisher","first-page":"1577","DOI":"10.1007\/s11590-015-0950-z","volume":"10","author":"A Diabat","year":"2016","unstructured":"Diabat, A.: A capacitated facility location and inventory management problem with single sourcing. Optim. Lett. 10(7), 1577\u20131592 (2016)","journal-title":"Optim. Lett."},{"key":"28_CR11","volume-title":"Introduction to Algorithms","author":"TH Cormen","year":"2001","unstructured":"Cormen, T.H., Stein, C., Rivest, R.L., Leiserson, C.E.: Introduction to Algorithms, 2nd edn. McGraw-Hill Higher Education, New York (2001)","edition":"2"},{"issue":"7","key":"28_CR12","doi-asserted-by":"publisher","first-page":"940","DOI":"10.1016\/j.jpdc.2012.02.007","volume":"73","author":"D Delling","year":"2013","unstructured":"Delling, D., et al.: PHAST: hardware-accelerated shortest path trees. J. Parallel Distrib. Comput. 73(7), 940\u2013952 (2013)","journal-title":"J. Parallel Distrib. Comput."},{"issue":"5824","key":"28_CR13","doi-asserted-by":"publisher","first-page":"566","DOI":"10.1126\/science.1137521","volume":"316","author":"H Bast","year":"2007","unstructured":"Bast, H., et al.: Fast routing in road networks with transit nodes. Science 316(5824), 566 (2007)","journal-title":"Science"},{"issue":"3","key":"28_CR14","first-page":"409","volume":"10","author":"N Jing","year":"1998","unstructured":"Jing, N., et al.: Hierarchical encoded path views for path query processing: an optimal model and its performance evaluation. IEEE Trans. KDE 10(3), 409\u2013432 (1998)","journal-title":"IEEE Trans. KDE"},{"issue":"1","key":"28_CR15","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1002\/net.20477","volume":"59","author":"E Bortnikov","year":"2012","unstructured":"Bortnikov, E., Khuller, S., Li, J., Mansour, Y., Naor, J.S.: The load-distance balancing problem. Networks 59(1), 22\u201329 (2012)","journal-title":"Networks"},{"key":"28_CR16","volume-title":"Algorithm Design","author":"J Kleinberg","year":"2009","unstructured":"Kleinberg, J., Tardos, E.: Algorithm Design. Pearson Education, London (2009)"}],"container-title":["Lecture Notes in Computer Science","Database and Expert Systems Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-98809-2_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T08:33:57Z","timestamp":1710232437000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-98809-2_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319988085","9783319988092"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-98809-2_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"9 August 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DEXA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Database and Expert Systems Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Regensburg","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":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 September 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 September 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dexa2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.dexa.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}