{"id":"https://openalex.org/W2967364660","doi":"https://doi.org/10.1145/3329676","title":"Fast Computation of Clustered Many-to-many Shortest Paths and Its Application to Map Matching","display_name":"Fast Computation of Clustered Many-to-many Shortest Paths and Its Application to Map Matching","publication_year":2019,"publication_date":"2019-08-12","ids":{"openalex":"https://openalex.org/W2967364660","doi":"https://doi.org/10.1145/3329676","mag":"2967364660"},"language":"en","primary_location":{"id":"doi:10.1145/3329676","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3329676","pdf_url":null,"source":{"id":"https://openalex.org/S2503711797","display_name":"ACM Transactions on Spatial Algorithms and Systems","issn_l":"2374-0353","issn":["2374-0353","2374-0361"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Spatial Algorithms and Systems","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://dr.ntu.edu.sg/bitstream/10356/145630/2/J19.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5051180586","display_name":"George Rosario Jagadeesh","orcid":"https://orcid.org/0000-0003-0166-0409"},"institutions":[{"id":"https://openalex.org/I172675005","display_name":"Nanyang Technological University","ror":"https://ror.org/02e7b5302","country_code":"SG","type":"education","lineage":["https://openalex.org/I172675005"]}],"countries":["SG"],"is_corresponding":true,"raw_author_name":"George R. Jagadeesh","raw_affiliation_strings":["Nanyang Technological University, Singapore"],"raw_orcid":"https://orcid.org/0000-0003-0166-0409","affiliations":[{"raw_affiliation_string":"Nanyang Technological University, Singapore","institution_ids":["https://openalex.org/I172675005"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5070475093","display_name":"Thambipillai Srikanthan","orcid":"https://orcid.org/0000-0003-3664-4345"},"institutions":[{"id":"https://openalex.org/I172675005","display_name":"Nanyang Technological University","ror":"https://ror.org/02e7b5302","country_code":"SG","type":"education","lineage":["https://openalex.org/I172675005"]}],"countries":["SG"],"is_corresponding":false,"raw_author_name":"Thambipillai Srikanthan","raw_affiliation_strings":["Nanyang Technological University, Singapore"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Nanyang Technological University, Singapore","institution_ids":["https://openalex.org/I172675005"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5051180586"],"corresponding_institution_ids":["https://openalex.org/I172675005"],"apc_list":null,"apc_paid":null,"fwci":0.5008,"has_fulltext":true,"cited_by_count":4,"citation_normalized_percentile":{"value":0.63372128,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":95},"biblio":{"volume":"5","issue":"3","first_page":"1","last_page":"20"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10698","display_name":"Transportation Planning and Optimization","score":0.9976000189781189,"subfield":{"id":"https://openalex.org/subfields/3313","display_name":"Transportation"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T11344","display_name":"Traffic Prediction and Management Techniques","score":0.9948999881744385,"subfield":{"id":"https://openalex.org/subfields/2215","display_name":"Building and Construction"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.7347904443740845},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7105765342712402},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.6874562501907349},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5938287377357483},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.575482964515686},{"id":"https://openalex.org/keywords/exploit","display_name":"Exploit","score":0.5565400719642639},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.5235435962677002},{"id":"https://openalex.org/keywords/map-matching","display_name":"Map matching","score":0.5210342407226562},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.48008543252944946},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4568122625350952},{"id":"https://openalex.org/keywords/boundary","display_name":"Boundary (topology)","score":0.43752753734588623},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.42426568269729614},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3937455713748932},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.18819645047187805},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.1178193986415863},{"id":"https://openalex.org/keywords/global-positioning-system","display_name":"Global Positioning System","score":0.11195182800292969},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.10579243302345276}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.7347904443740845},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7105765342712402},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.6874562501907349},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5938287377357483},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.575482964515686},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.5565400719642639},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.5235435962677002},{"id":"https://openalex.org/C2778559875","wikidata":"https://www.wikidata.org/wiki/Q1892023","display_name":"Map matching","level":3,"score":0.5210342407226562},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.48008543252944946},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4568122625350952},{"id":"https://openalex.org/C62354387","wikidata":"https://www.wikidata.org/wiki/Q875399","display_name":"Boundary (topology)","level":2,"score":0.43752753734588623},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.42426568269729614},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3937455713748932},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.18819645047187805},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.1178193986415863},{"id":"https://openalex.org/C60229501","wikidata":"https://www.wikidata.org/wiki/Q18822","display_name":"Global Positioning System","level":2,"score":0.11195182800292969},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.10579243302345276},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3329676","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3329676","pdf_url":null,"source":{"id":"https://openalex.org/S2503711797","display_name":"ACM Transactions on Spatial Algorithms and Systems","issn_l":"2374-0353","issn":["2374-0353","2374-0361"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Spatial Algorithms and Systems","raw_type":"journal-article"},{"id":"pmh:oai:dr.ntu.edu.sg:10356/145630","is_oa":true,"landing_page_url":"https://hdl.handle.net/10356/145630","pdf_url":"https://dr.ntu.edu.sg/bitstream/10356/145630/2/J19.pdf","source":{"id":"https://openalex.org/S4306402609","display_name":"DR-NTU (Nanyang Technological University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I172675005","host_organization_name":"Nanyang Technological University","host_organization_lineage":["https://openalex.org/I172675005"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Journal Article"}],"best_oa_location":{"id":"pmh:oai:dr.ntu.edu.sg:10356/145630","is_oa":true,"landing_page_url":"https://hdl.handle.net/10356/145630","pdf_url":"https://dr.ntu.edu.sg/bitstream/10356/145630/2/J19.pdf","source":{"id":"https://openalex.org/S4306402609","display_name":"DR-NTU (Nanyang Technological University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I172675005","host_organization_name":"Nanyang Technological University","host_organization_lineage":["https://openalex.org/I172675005"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Journal Article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities","score":0.6700000166893005}],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2967364660.pdf","grobid_xml":"https://content.openalex.org/works/W2967364660.grobid-xml"},"referenced_works_count":32,"referenced_works":["https://openalex.org/W190901240","https://openalex.org/W1605476884","https://openalex.org/W1725285272","https://openalex.org/W1905010114","https://openalex.org/W1920191655","https://openalex.org/W1953838480","https://openalex.org/W1977545325","https://openalex.org/W1996573126","https://openalex.org/W2014889099","https://openalex.org/W2026824953","https://openalex.org/W2053180906","https://openalex.org/W2055269077","https://openalex.org/W2075364600","https://openalex.org/W2084634989","https://openalex.org/W2090227767","https://openalex.org/W2101778955","https://openalex.org/W2103182342","https://openalex.org/W2104317982","https://openalex.org/W2128641067","https://openalex.org/W2135822894","https://openalex.org/W2143072141","https://openalex.org/W2143083884","https://openalex.org/W2145022515","https://openalex.org/W2166771065","https://openalex.org/W2169528473","https://openalex.org/W2295096861","https://openalex.org/W2401054706","https://openalex.org/W2585773957","https://openalex.org/W2768256553","https://openalex.org/W2917755861","https://openalex.org/W2962893883","https://openalex.org/W2962917186"],"related_works":["https://openalex.org/W4321491762","https://openalex.org/W2069951930","https://openalex.org/W2026630113","https://openalex.org/W2081843224","https://openalex.org/W2372473202","https://openalex.org/W2128634324","https://openalex.org/W3103134159","https://openalex.org/W2102755248","https://openalex.org/W2384089948","https://openalex.org/W2008652244"],"abstract_inverted_index":{"We":[0,71,141],"examine":[1],"the":[2,57,77,81,88,100,118,128,132,145],"problem":[3,53],"of":[4,15,23,38,46,60,80,96,108,124,150,155],"computing":[5],"shortest":[6,28,64],"paths":[7,91],"in":[8,138],"a":[9,13,21,62,94,105,112,122,139],"transportation":[10],"network":[11,115],"from":[12,93],"set":[14,22],"geographically":[16],"clustered":[17,78,137],"source":[18,69,82,101,133],"nodes":[19,97,134],"to":[20,51,56],"target":[24],"nodes.":[25,83,109],"Such":[26],"many-to-many":[27],"path":[29,65],"computations":[30],"are":[31,135],"an":[32,73],"essential":[33],"and":[34,157],"computationally":[35],"expensive":[36],"part":[37],"many":[39],"emerging":[40],"applications":[41],"that":[42,75,90,117,144],"involve":[43],"map":[44,153],"matching":[45,154],"imprecise":[47],"trajectories.":[48,159],"Existing":[49],"solutions":[50],"this":[52],"mostly":[54],"conform":[55],"obvious":[58],"approach":[59,130],"performing":[61],"single-source":[63],"computation":[66],"for":[67],"each":[68],"node.":[70],"present":[72],"algorithm":[74,120],"exploits":[76],"nature":[79],"Specifically,":[84],"we":[85],"rely":[86],"on":[87,111],"observation":[89],"originating":[92],"cluster":[95],"typically":[98],"exit":[99],"region's":[102],"boundary":[103],"through":[104],"small":[106],"number":[107],"Evaluations":[110],"real":[113],"road":[114],"show":[116],"proposed":[119],"provides":[121],"speed-up":[123],"several":[125],"times":[126],"over":[127],"conventional":[129],"when":[131],"densely":[136],"region.":[140],"also":[142],"demonstrate":[143],"presented":[146],"technique":[147],"is":[148],"capable":[149],"substantially":[151],"accelerating":[152],"sparse":[156],"noisy":[158]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2019,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}