{"id":"https://openalex.org/W2149964853","doi":"https://doi.org/10.1145/1064546.1103378","title":"Geometric containers for efficient shortest-path computation","display_name":"Geometric containers for efficient shortest-path computation","publication_year":2005,"publication_date":"2005-12-31","ids":{"openalex":"https://openalex.org/W2149964853","doi":"https://doi.org/10.1145/1064546.1103378","mag":"2149964853"},"language":"en","primary_location":{"id":"doi:10.1145/1064546.1103378","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1064546.1103378","pdf_url":null,"source":{"id":"https://openalex.org/S201104086","display_name":"ACM Journal of Experimental Algorithmics","issn_l":"1084-6654","issn":["1084-6654"],"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 Journal of Experimental Algorithmics","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5045460793","display_name":"Dorothea Wagner","orcid":"https://orcid.org/0000-0002-9141-7076"},"institutions":[{"id":"https://openalex.org/I4210119349","display_name":"Karlsruhe University of Education","ror":"https://ror.org/01t1kq612","country_code":"DE","type":"education","lineage":["https://openalex.org/I4210119349"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Dorothea Wagner","raw_affiliation_strings":["Universit\u00e4t Karlsruhe (TH), Karlsruhe, Germany"],"affiliations":[{"raw_affiliation_string":"Universit\u00e4t Karlsruhe (TH), Karlsruhe, Germany","institution_ids":["https://openalex.org/I4210119349"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5010657180","display_name":"Thomas Willhalm","orcid":"https://orcid.org/0000-0001-8505-0936"},"institutions":[{"id":"https://openalex.org/I4210119349","display_name":"Karlsruhe University of Education","ror":"https://ror.org/01t1kq612","country_code":"DE","type":"education","lineage":["https://openalex.org/I4210119349"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Thomas Willhalm","raw_affiliation_strings":["Universit\u00e4t Karlsruhe (TH), Karlsruhe, Germany"],"affiliations":[{"raw_affiliation_string":"Universit\u00e4t Karlsruhe (TH), Karlsruhe, Germany","institution_ids":["https://openalex.org/I4210119349"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5014917579","display_name":"Christos Zaroliagis","orcid":"https://orcid.org/0000-0003-1425-5138"},"institutions":[{"id":"https://openalex.org/I174878644","display_name":"University of Patras","ror":"https://ror.org/017wvtq80","country_code":"GR","type":"education","lineage":["https://openalex.org/I174878644"]}],"countries":["GR"],"is_corresponding":false,"raw_author_name":"Christos Zaroliagis","raw_affiliation_strings":["University of Patras, Patras, Greece"],"affiliations":[{"raw_affiliation_string":"University of Patras, Patras, Greece","institution_ids":["https://openalex.org/I174878644"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5045460793"],"corresponding_institution_ids":["https://openalex.org/I4210119349"],"apc_list":null,"apc_paid":null,"fwci":4.2154,"has_fulltext":false,"cited_by_count":88,"citation_normalized_percentile":{"value":0.94754768,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"10","issue":null,"first_page":null,"last_page":null},"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/T10799","display_name":"Data Visualization and Analytics","score":0.9968000054359436,"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"}},{"id":"https://openalex.org/T10317","display_name":"Advanced Database Systems and Queries","score":0.9883000254631042,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.8168591260910034},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.6657013893127441},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6348539590835571},{"id":"https://openalex.org/keywords/graph-traversal","display_name":"Graph traversal","score":0.5421148538589478},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4914320707321167},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.47051137685775757},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4503744840621948},{"id":"https://openalex.org/keywords/pathfinding","display_name":"Pathfinding","score":0.44910383224487305},{"id":"https://openalex.org/keywords/suurballes-algorithm","display_name":"Suurballe's algorithm","score":0.4159132242202759}],"concepts":[{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.8168591260910034},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6657013893127441},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6348539590835571},{"id":"https://openalex.org/C96333769","wikidata":"https://www.wikidata.org/wiki/Q907955","display_name":"Graph traversal","level":3,"score":0.5421148538589478},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4914320707321167},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.47051137685775757},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4503744840621948},{"id":"https://openalex.org/C25321074","wikidata":"https://www.wikidata.org/wiki/Q1969601","display_name":"Pathfinding","level":4,"score":0.44910383224487305},{"id":"https://openalex.org/C98779529","wikidata":"https://www.wikidata.org/wiki/Q7650417","display_name":"Suurballe's algorithm","level":5,"score":0.4159132242202759}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/1064546.1103378","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1064546.1103378","pdf_url":null,"source":{"id":"https://openalex.org/S201104086","display_name":"ACM Journal of Experimental Algorithmics","issn_l":"1084-6654","issn":["1084-6654"],"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 Journal of Experimental Algorithmics","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.331.3662","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.331.3662","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://i11www.iti.uni-karlsruhe.de/extra/publications/wwz-gcesp-05.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":52,"referenced_works":["https://openalex.org/W27247825","https://openalex.org/W79845460","https://openalex.org/W127515624","https://openalex.org/W136556473","https://openalex.org/W175307687","https://openalex.org/W179323378","https://openalex.org/W205976932","https://openalex.org/W1480135873","https://openalex.org/W1545707055","https://openalex.org/W1549911051","https://openalex.org/W1550136763","https://openalex.org/W1554407673","https://openalex.org/W1556442714","https://openalex.org/W1561240874","https://openalex.org/W1566918731","https://openalex.org/W1567903304","https://openalex.org/W1572663059","https://openalex.org/W1601726608","https://openalex.org/W1646289414","https://openalex.org/W1649645444","https://openalex.org/W1673383737","https://openalex.org/W1847690346","https://openalex.org/W1953148806","https://openalex.org/W1968023964","https://openalex.org/W1982289281","https://openalex.org/W1989111470","https://openalex.org/W2011824721","https://openalex.org/W2022980325","https://openalex.org/W2029706450","https://openalex.org/W2049354208","https://openalex.org/W2061208844","https://openalex.org/W2073328808","https://openalex.org/W2077383738","https://openalex.org/W2084224084","https://openalex.org/W2094826544","https://openalex.org/W2095352457","https://openalex.org/W2096594665","https://openalex.org/W2101923813","https://openalex.org/W2103776069","https://openalex.org/W2115680394","https://openalex.org/W2129673493","https://openalex.org/W2131237536","https://openalex.org/W2147219339","https://openalex.org/W2156153879","https://openalex.org/W2169528473","https://openalex.org/W2169910125","https://openalex.org/W2180471588","https://openalex.org/W2295185831","https://openalex.org/W2405878055","https://openalex.org/W4285719527","https://openalex.org/W6608375579","https://openalex.org/W6636881286"],"related_works":["https://openalex.org/W4383900343","https://openalex.org/W3015233512","https://openalex.org/W2136320479","https://openalex.org/W2990531685","https://openalex.org/W2886722595","https://openalex.org/W4221129498","https://openalex.org/W3088868185","https://openalex.org/W78690942","https://openalex.org/W4310124294","https://openalex.org/W2394042577"],"abstract_inverted_index":{"A":[0],"fundamental":[1],"approach":[2],"in":[3,11,98,176,236],"finding":[4],"efficiently":[5],"best":[6],"routes":[7],"or":[8],"optimal":[9],"itineraries":[10],"traffic":[12,123],"information":[13,84,97],"systems":[14],"is":[15,202],"to":[16,62,148,155,166,187,205,211,230],"reduce":[17],"the":[18,26,44,63,66,71,90,110,137,151,181,189,220],"search":[19,45,72],"space":[20,46,73],"(part":[21],"of":[22,25,43,57,65,74,89,112,115,140,191,193,196],"graph":[23,91],"visited)":[24],"most":[27],"commonly":[28],"used":[29],"shortest":[30],"path":[31],"routine":[32],"(Dijkstra's":[33],"algorithm)":[34],"on":[35],"a":[36,54,86,200,213],"suitably":[37],"defined":[38],"graph.":[39,67],"We":[40,68,103,125],"investigate":[41],"reduction":[42],"while":[47],"simultaneously":[48],"retaining":[49],"data":[50,120],"structures,":[51],"created":[52],"during":[53],"preprocessing":[55],"phase,":[56],"size":[58,64],"linear":[59],"(i.e.,":[60],"optimal)":[61],"show":[69,159],"that":[70,160,184,217],"Dijkstra's":[75,197],"algorithm":[76],"can":[77],"be":[78,156],"significantly":[79],"reduced":[80],"by":[81,93],"extracting":[82],"geometric":[83,100,116,152],"from":[85,121,173],"given":[87],"layout":[88],"and":[92,150,158,225,232],"encapsulating":[94],"precomputed":[95],"shortest-path":[96],"resulted":[99],"objects":[101],"(containers).":[102],"present":[104,127],"an":[105,133,177],"extensive":[106],"experimental":[107],"study":[108,135],"comparing":[109],"impact":[111],"different":[113],"types":[114],"containers":[117,153],"using":[118],"test":[119],"real-world":[122],"networks.":[124],"also":[126],"new":[128,162],"algorithms":[129],"as":[130,132,207,227],"well":[131],"empirical":[134],"for":[136],"dynamic":[138],"case":[139],"this":[141],"problem,":[142],"where":[143],"edge":[144],"weights":[145],"are":[146,164],"subject":[147],"change":[149],"have":[154],"updated":[157],"our":[161,194,208],"methods":[163],"two":[165],"three":[167],"times":[168],"faster":[169],"than":[170],"recomputing":[171],"everything":[172],"scratch.":[174],"Finally,":[175],"appendix,":[178],"we":[179,185,228],"discuss":[180],"software":[182],"framework":[183,201],"developed":[186],"realize":[188],"implementations":[190],"all":[192],"variants":[195,235],"algorithm.":[198],"Such":[199],"not":[203],"trivial":[204],"achieve":[206],"goal":[209],"was":[210],"maintain":[212],"common":[214],"code":[215],"base":[216],"is,":[218],"at":[219],"same":[221],"time,":[222],"small,":[223],"efficient,":[224],"flexible,":[226],"wanted":[229],"enhance":[231],"combine":[233],"several":[234],"any":[237],"possible":[238],"way.":[239]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":6},{"year":2021,"cited_by_count":7},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":6},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":6},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":7}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}