{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T17:34:50Z","timestamp":1742924090401,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030602444"},{"type":"electronic","value":"9783030602451"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","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":[[2020]]},"DOI":"10.1007\/978-3-030-60245-1_9","type":"book-chapter","created":{"date-parts":[[2020,9,30]],"date-time":"2020-09-30T08:06:00Z","timestamp":1601453160000},"page":"125-142","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Multi-threaded Algorithm for Capacity Constrained Assignment over Road Networks"],"prefix":"10.1007","author":[{"given":"Abhishek","family":"Mishra","sequence":"first","affiliation":[]},{"given":"Venkata M. V.","family":"Gunturi","sequence":"additional","affiliation":[]},{"given":"Sarnath","family":"Ramnath","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,9,29]]},"reference":[{"key":"9_CR1","doi-asserted-by":"crossref","unstructured":"Azad, A., Bulu\u00e7, A.: Distributed-memory algorithms for maximum cardinality matching in bipartite graphs. In: Proceedings of the IPDPS, pp. 32\u201342 (2016)","DOI":"10.1109\/IPDPS.2016.103"},{"issue":"1","key":"9_CR2","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1002\/net.20477","volume":"59","author":"E Bortnikov","year":"2012","unstructured":"Bortnikov, E., et al.: The load-distance balancing problem. Networks 59(1), 22\u201329 (2012)","journal-title":"Networks"},{"key":"9_CR3","unstructured":"Cormen, T.H., Stein, C., Rivest, R.L., Leiserson, C.E.: Introduction to Algorithms, 2nd edn. McGraw-Hill Higher Education, New York (2001)"},{"key":"9_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"850","DOI":"10.1007\/978-3-642-40047-6_84","volume-title":"Euro-Par 2013 Parallel Processing","author":"M Deveci","year":"2013","unstructured":"Deveci, M., Kaya, K., U\u00e7ar, B., \u00c7ataly\u00fcrek, \u00dc.V.: GPU accelerated maximum cardinality matching algorithms for bipartite graphs. In: Wolf, F., Mohr, B., an Mey, D. (eds.) Euro-Par 2013. LNCS, vol. 8097, pp. 850\u2013861. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40047-6_84"},{"issue":"3","key":"9_CR5","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1145\/3306208","volume":"62","author":"S Fenner","year":"2019","unstructured":"Fenner, S., Gurjar, R., Thierauf, T.: A deterministic parallel algorithm for bipartite perfect matching. Commun. ACM 62(3), 109\u2013115 (2019)","journal-title":"Commun. ACM"},{"key":"9_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/978-3-540-68552-4_24","volume-title":"Experimental Algorithms","author":"R Geisberger","year":"2008","unstructured":"Geisberger, R., Sanders, P., Schultes, D., Delling, D.: Contraction hierarchies: faster and simpler hierarchical routing in road networks. In: McGeoch, C.C. (ed.) WEA 2008. LNCS, vol. 5038, pp. 319\u2013333. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-68552-4_24"},{"key":"9_CR7","unstructured":"Hu, J., et al.: Towards energy efficient hybrid on-chip Scratch Pad Memory with non-volatile memory. In: 2011 Design, Automation Test in Europe, pp. 1\u20136 (2011)"},{"key":"9_CR8","doi-asserted-by":"publisher","unstructured":"Jiang, J., Wu, L.: Two-stage distributed parallel algorithm with message passing interface for maximum flow problem. J. Supercomputing 1\u201319 (2014). https:\/\/doi.org\/10.1007\/s11227-014-1314-7","DOI":"10.1007\/s11227-014-1314-7"},{"issue":"7","key":"9_CR9","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/j.parco.2014.03.004","volume":"40","author":"J Langguth","year":"2014","unstructured":"Langguth, J., et al.: On parallel push-relabel based algorithms for bipartite maximum matching. Parallel Comput. 40(7), 289\u2013308 (2014)","journal-title":"Parallel Comput."},{"key":"9_CR10","unstructured":"Li, J., et al.: Resource allocation robustness in multi-core embedded systems with inaccurate information. J. Syst. Archit. 57(9), 840\u2013849 (2011)"},{"key":"9_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"688","DOI":"10.1007\/978-3-642-32820-6_68","volume-title":"Euro-Par 2012 Parallel Processing","author":"A Lingas","year":"2012","unstructured":"Lingas, A., Persson, M.: A fast parallel algorithm for minimum-cost small integral flows. In: Kaklamanis, C., Papatheodorou, T., Spirakis, P.G. (eds.) Euro-Par 2012. LNCS, vol. 7484, pp. 688\u2013699. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32820-6_68"},{"key":"9_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1007\/978-3-319-98809-2_28","volume-title":"Database and Expert Systems Applications","author":"A Mehta","year":"2018","unstructured":"Mehta, A., Malik, K., Gunturi, V.M.V., Goel, A., Sethia, P., Aggarwal, A.: Load balancing in network Voronoi diagrams under overload penalties. In: Hartmann, S., Ma, H., Hameurlain, A., Pernul, G., Wagner, R.R. (eds.) DEXA 2018. LNCS, vol. 11029, pp. 457\u2013475. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-98809-2_28"},{"issue":"6","key":"9_CR13","doi-asserted-by":"publisher","first-page":"767","DOI":"10.1016\/S0167-8191(03)00022-X","volume":"29","author":"N Nagy","year":"2003","unstructured":"Nagy, N., Akl, S.G.: The maximum flow problem: a real-time approach. Parallel Comput. 29(6), 767\u2013794 (2003)","journal-title":"Parallel Comput."},{"issue":"9","key":"9_CR14","first-page":"965","volume":"22","author":"A Okabe","year":"2008","unstructured":"Okabe, A., et al.: Generalized network Voronoi diagrams: concepts, computational methods, and applications. Intl. J. GIS 22(9), 965\u2013994 (2008)","journal-title":"Intl. J. GIS"},{"issue":"1","key":"9_CR15","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1080\/03055690097727","volume":"26","author":"E Parsons","year":"2000","unstructured":"Parsons, E., et al.: School catchments and pupil movements: a case study in parental choice. Educ. Stud. 26(1), 33\u201348 (2000)","journal-title":"Educ. Stud."},{"key":"9_CR16","doi-asserted-by":"crossref","unstructured":"Qiu, H., et al.: An efficient key distribution system for data fusion in V2X heterogeneous networks. Inf. Fusion 50, 212\u2013220 (2019)","DOI":"10.1016\/j.inffus.2019.02.002"},{"key":"9_CR17","unstructured":"Qiu, M., et al.: Data allocation for hybrid memory with genetic algorithm. IEEE Trans. Emerg. Topics Comput. 3(4), 544\u2013555 (2015)"},{"key":"9_CR18","doi-asserted-by":"crossref","unstructured":"Leong, H.U., 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":"9_CR19","doi-asserted-by":"crossref","unstructured":"Yang, K., et al.: Capacity-constrained network-Voronoi diagram. IEEE Trans. Knowl. Data Eng. 27(11), 2919\u20132932 (2015)","DOI":"10.1109\/TKDE.2015.2445756"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Architectures for Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-60245-1_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,21]],"date-time":"2022-11-21T08:35:46Z","timestamp":1669019746000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-60245-1_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030602444","9783030602451"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-60245-1_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"29 September 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICA3PP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithms and Architectures for Parallel Processing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"New York, NY","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 October 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 October 2020","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":"ica3pp2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.cloud-conf.net\/ica3pp2020\/","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 (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":"495","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":"142","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":"5","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":"29% - 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":"305","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":"10","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)"}}]}}