{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T10:13:48Z","timestamp":1781086428324,"version":"3.54.1"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031208904","type":"print"},{"value":"9783031208911","type":"electronic"}],"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-20891-1_9","type":"book-chapter","created":{"date-parts":[[2022,11,7]],"date-time":"2022-11-07T00:03:02Z","timestamp":1667779382000},"page":"110-118","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A Multi-Threading Algorithm for Constrained Path Optimization Problem on Road Networks"],"prefix":"10.1007","author":[{"given":"Kousik Kumar","family":"Dutta","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ankita","family":"Dewan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Venkata M. V.","family":"Gunturi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,11,7]]},"reference":[{"issue":"7","key":"9_CR1","first-page":"2031","volume":"28","author":"VT Chakaravarthy","year":"2017","unstructured":"Chakaravarthy, V.T., et al.: Scalable single source shortest path algorithms for massively parallel systems. IEEE Trans on PDS 28(7), 2031\u20132045 (2017)","journal-title":"IEEE Trans on PDS"},{"key":"9_CR2","unstructured":"Chekuri, C., et al.: A recursive greedy algorithm for walks in directed graphs. In: Proc. of Symp. on Foundations of Comp. Sci. pp. 245\u2013253. IEEE (2005)"},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"Demiryurek, U., et al.: Online computation of fastest path in time-dependent spatial networks. In: Proc. SSTD, LNCS Vol. no 6849. pp. 92\u2013111. Springer (2011)","DOI":"10.1007\/978-3-642-22922-0_7"},{"key":"9_CR4","doi-asserted-by":"publisher","unstructured":"Dutta, K.K., Dewan, A., Gunturi, V.M.V.: A multi-threading algorithm for constrained path optimization problem on road networks. CoRR abs\/2208.02296 (2022). https:\/\/doi.org\/10.48550\/arXiv.2208.02296","DOI":"10.48550\/arXiv.2208.02296"},{"issue":"2","key":"9_CR5","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1016\/j.ipl.2014.10.003","volume":"115","author":"D Gavalas","year":"2015","unstructured":"Gavalas, D., et al.: Approximation algorithms for the arc orienteering problem. Information Processing Letters 115(2), 313\u2013315 (2015)","journal-title":"Information Processing Letters"},{"key":"9_CR6","doi-asserted-by":"crossref","unstructured":"Gunturi, V., Shekhar, S.: Spatio-Temporal Graph Data Analytics. Springer isbn 978-3-319-67770-5 (2017)","DOI":"10.1007\/978-3-319-67771-2_2"},{"key":"9_CR7","unstructured":"Henke, N., et al.: The age of analytics: Competing in a data-driven world, Mckinsey Global Institute https:\/\/tinyurl.com\/yb7vytkg (Dec 2016)"},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"Karduni, A., et al.: A protocol to convert spatial polyline data to network formats and applications to world urban road networks. Scientific Data 3(160046) (2016)","DOI":"10.1038\/sdata.2016.46"},{"key":"9_CR9","doi-asserted-by":"crossref","unstructured":"Kaur, R., et al.: Finding the most navigable path in road networks: A summary of results. In: Proc. of DEXA. LNCS, vol. 11029, pp. 440\u2013456. Springer (2018)","DOI":"10.1007\/978-3-319-98809-2_27"},{"key":"9_CR10","doi-asserted-by":"crossref","unstructured":"Kaur, R., et\u00a0al.: Finding the most navigable path in road networks. Geoinformatica 25(1), 207\u2013240 (2021)","DOI":"10.1007\/s10707-020-00428-5"},{"key":"9_CR11","doi-asserted-by":"crossref","unstructured":"Li, Y., et. al.: Physics-guided energy-efficient path selection: a summary of results. In: Proc. of the 26th ACM SIGSPATIAL. pp. 99\u2013108 (2018)","DOI":"10.1145\/3274895.3274933"},{"key":"9_CR12","doi-asserted-by":"crossref","unstructured":"Liu, Z., et al.: Efficient constrained shortest path query answering with forest hop labeling. In: IEEE 37th ICDE. pp. 1763\u20131774 (2021)","DOI":"10.1109\/ICDE51399.2021.00155"},{"key":"9_CR13","doi-asserted-by":"crossref","unstructured":"Lu, Y., Shahabi, C.: An arc orienteering algorithm to find the most scenic path on a large-scale road network. In: Proc. of the 23rd SIGSPATIAL. ACM (2015)","DOI":"10.1145\/2820783.2820835"},{"key":"9_CR14","unstructured":"Shekhar, S., Chawla, S.: A tour of spatial databases. Prentice Hall Upper Saddle River (2003)"},{"key":"9_CR15","doi-asserted-by":"crossref","unstructured":"Vishwakarma, K., Gunturi, V.M.V.: Impromptu rendezvous based multi-threaded algorithm for shortest lagrangian path problem on road networks. In: Proc. of the ICA3PP. pp. 201\u2013222 (2019)","DOI":"10.1007\/978-3-030-38991-8_14"},{"issue":"2","key":"9_CR16","doi-asserted-by":"publisher","first-page":"61","DOI":"10.14778\/3015274.3015277","volume":"10","author":"S Wang","year":"2016","unstructured":"Wang, S., et al.: Effective indexing for approximate constrained shortest path queries on large road networks. Proc. VLDB Endow. 10(2), 61\u201372 (2016)","journal-title":"Proc. VLDB Endow."}],"container-title":["Lecture Notes in Computer Science","Web Information Systems Engineering \u2013 WISE 2022"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-20891-1_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,7]],"date-time":"2022-11-07T00:39:10Z","timestamp":1667781550000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-20891-1_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031208904","9783031208911"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-20891-1_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"7 November 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WISE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Web Information Systems Engineering","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Biarritz","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","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":"31 October 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 November 2022","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":"wise2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/wise2022.sigappfr.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 (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":"94","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":"31","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":"13","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":"33% - 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.5","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":"2.5","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)"}},{"value":"The proceedings include 3 demo papers","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}