{"id":"https://openalex.org/W2395226356","doi":"https://doi.org/10.1007/978-3-319-28678-5_8","title":"Minimizing Walking Length in Map Matching","display_name":"Minimizing Walking Length in Map Matching","publication_year":2016,"publication_date":"2016-01-01","ids":{"openalex":"https://openalex.org/W2395226356","doi":"https://doi.org/10.1007/978-3-319-28678-5_8","mag":"2395226356"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-319-28678-5_8","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-28678-5_8","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://inria.hal.science/hal-01446266","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5076883589","display_name":"Amin Gheibi","orcid":"https://orcid.org/0000-0002-0364-7585"},"institutions":[{"id":"https://openalex.org/I67031392","display_name":"Carleton University","ror":"https://ror.org/02qtvee93","country_code":"CA","type":"education","lineage":["https://openalex.org/I67031392"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Amin Gheibi","raw_affiliation_strings":["School of Computer Science, Carleton University, Ottawa, ON, Canada"],"affiliations":[{"raw_affiliation_string":"School of Computer Science, Carleton University, Ottawa, ON, Canada","institution_ids":["https://openalex.org/I67031392"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5103136561","display_name":"Anil Maheshwari","orcid":"https://orcid.org/0000-0002-1274-4598"},"institutions":[{"id":"https://openalex.org/I67031392","display_name":"Carleton University","ror":"https://ror.org/02qtvee93","country_code":"CA","type":"education","lineage":["https://openalex.org/I67031392"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Anil Maheshwari","raw_affiliation_strings":["School of Computer Science, Carleton University, Ottawa, ON, Canada"],"affiliations":[{"raw_affiliation_string":"School of Computer Science, Carleton University, Ottawa, ON, Canada","institution_ids":["https://openalex.org/I67031392"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5085978384","display_name":"J\u00f6rg-R\u00fcdiger Sack","orcid":"https://orcid.org/0000-0001-5936-1319"},"institutions":[{"id":"https://openalex.org/I67031392","display_name":"Carleton University","ror":"https://ror.org/02qtvee93","country_code":"CA","type":"education","lineage":["https://openalex.org/I67031392"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"J\u00f6rg-R\u00fcdiger Sack","raw_affiliation_strings":["School of Computer Science, Carleton University, Ottawa, ON, Canada"],"affiliations":[{"raw_affiliation_string":"School of Computer Science, Carleton University, Ottawa, ON, Canada","institution_ids":["https://openalex.org/I67031392"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5076883589"],"corresponding_institution_ids":["https://openalex.org/I67031392"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":{"value":5000,"currency":"EUR","value_usd":5392},"fwci":3.1019,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.93243243,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"105","last_page":"120"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9998999834060669,"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.9998999834060669,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9983000159263611,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/T12292","display_name":"Graph Theory and Algorithms","score":0.9958000183105469,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7554298639297485},{"id":"https://openalex.org/keywords/embedding","display_name":"Embedding","score":0.6389710307121277},{"id":"https://openalex.org/keywords/planar","display_name":"Planar","score":0.5399193167686462},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5258044600486755},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.5159131288528442},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5072119235992432},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.5039970278739929},{"id":"https://openalex.org/keywords/plane","display_name":"Plane (geometry)","score":0.4922110140323639},{"id":"https://openalex.org/keywords/line-segment","display_name":"Line segment","score":0.46907609701156616},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.45515507459640503},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.45109838247299194},{"id":"https://openalex.org/keywords/computational-geometry","display_name":"Computational geometry","score":0.41288357973098755},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4086523652076721},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3726779818534851},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.34727638959884644},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.30129480361938477},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.2608913779258728},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.11217457056045532}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7554298639297485},{"id":"https://openalex.org/C41608201","wikidata":"https://www.wikidata.org/wiki/Q980509","display_name":"Embedding","level":2,"score":0.6389710307121277},{"id":"https://openalex.org/C134786449","wikidata":"https://www.wikidata.org/wiki/Q3391255","display_name":"Planar","level":2,"score":0.5399193167686462},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5258044600486755},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.5159131288528442},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5072119235992432},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5039970278739929},{"id":"https://openalex.org/C17825722","wikidata":"https://www.wikidata.org/wiki/Q17285","display_name":"Plane (geometry)","level":2,"score":0.4922110140323639},{"id":"https://openalex.org/C182124507","wikidata":"https://www.wikidata.org/wiki/Q166154","display_name":"Line segment","level":2,"score":0.46907609701156616},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.45515507459640503},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.45109838247299194},{"id":"https://openalex.org/C29123130","wikidata":"https://www.wikidata.org/wiki/Q874709","display_name":"Computational geometry","level":2,"score":0.41288357973098755},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4086523652076721},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3726779818534851},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.34727638959884644},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.30129480361938477},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.2608913779258728},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.11217457056045532},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","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},{"id":"https://openalex.org/C121684516","wikidata":"https://www.wikidata.org/wiki/Q7600677","display_name":"Computer graphics (images)","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/978-3-319-28678-5_8","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-28678-5_8","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:HAL:hal-01446266v1","is_oa":true,"landing_page_url":"https://inria.hal.science/hal-01446266","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"1st International Conference on Theoretical Computer Science (TTCS), Aug 2015, Tehran, Iran. pp.105-120, ⟨10.1007/978-3-319-28678-5_8⟩","raw_type":"Conference papers"}],"best_oa_location":{"id":"pmh:oai:HAL:hal-01446266v1","is_oa":true,"landing_page_url":"https://inria.hal.science/hal-01446266","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"1st International Conference on Theoretical Computer Science (TTCS), Aug 2015, Tehran, Iran. pp.105-120, ⟨10.1007/978-3-319-28678-5_8⟩","raw_type":"Conference papers"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities","score":0.4300000071525574}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W61330255","https://openalex.org/W805518803","https://openalex.org/W1482503584","https://openalex.org/W1544411027","https://openalex.org/W2006317032","https://openalex.org/W2010097736","https://openalex.org/W2021784334","https://openalex.org/W2058118329","https://openalex.org/W2088882941","https://openalex.org/W2110406564","https://openalex.org/W2124299914","https://openalex.org/W2126194848","https://openalex.org/W2136807817","https://openalex.org/W2403500509","https://openalex.org/W2612776813","https://openalex.org/W2943430289"],"related_works":["https://openalex.org/W4377371889","https://openalex.org/W1862126075","https://openalex.org/W2113623403","https://openalex.org/W2055932080","https://openalex.org/W4389362338","https://openalex.org/W1968512104","https://openalex.org/W2565109825","https://openalex.org/W2040444410","https://openalex.org/W78560857","https://openalex.org/W4389820491"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3,15,146],"propose":[4,107],"a":[5,9,18,23,27,29,35,46,52],"geometric":[6],"algorithm":[7,109,149],"for":[8,156],"map":[10],"matching":[11],"problem.":[12],"More":[13],"specifically,":[14],"are":[16],"given":[17],"planar":[19],"graph,":[20],"H,":[21,50],"with":[22,110],"straight-line":[24],"embedding":[25],"in":[26,49],"plane,":[28],"directed":[30],"polygonal":[31],"curve,":[32],"T,":[33,55,143],"and":[34,51,67,78,98,102,121,164],"distance":[36,71],"value":[37],"$$\\varepsilon":[38,83],">0$$":[39],".":[40],"The":[41],"task":[42],"is":[43,80,93,135],"to":[44,95,153],"find":[45],"path,":[47],"P,":[48],"parameterization":[53],"of":[54,60,63,104,138,140],"that":[56],"minimize":[57],"the":[58,61,70,73,90,136,148,161],"sum":[59],"length":[62],"walks":[64],"on":[65,100],"T":[66,79,101],"P":[68,77],"whereby":[69],"between":[72],"entities":[74],"moving":[75],"along":[76],"at":[81,86],"most":[82],"$$":[84,118,128],",":[85],"any":[87],"time":[88,119,163],"during":[89],"walks.":[91],"It":[92],"allowed":[94],"walk":[96],"forwards":[97],"backwards":[99],"edges":[103,139],"H.":[105],"We":[106],"an":[108],"$$\\mathcal":[111,122],"{O}\\left(":[112,123],"mn":[113,124],"\\left(":[114,125],"m+n\\right)":[115,126],"\\log":[116],"(mn)\\right)":[117],"complexity":[120],"\\right)":[127],"space":[129,165],"complexity,":[130],"where":[131],"m":[132],"(n,":[133],"respectively)":[134],"number":[137],"H":[141],"(of":[142],"respectively).":[144],"As":[145],"show,":[147],"can":[150],"be":[151],"generalized":[152],"work":[154],"also":[155],"weighted":[157],"non-planar":[158],"graphs":[159],"within":[160],"same":[162],"complexities.":[166]},"counts_by_year":[{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":4},{"year":2016,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}