{"id":"https://openalex.org/W39773528","doi":null,"title":"Geometric Shortest Path Containers","display_name":"Geometric Shortest Path Containers","publication_year":2004,"publication_date":"2004-01-01","ids":{"openalex":"https://openalex.org/W39773528","mag":"39773528"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.1.1745","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.1.1745","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"},"volume":null,"type":"article","is_traditional":true,"indexed_in":[],"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","observed_orcids":["https://orcid.org/0000-0002-9141-7076"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Dorothea Wagner","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5014917579","display_name":"Christos Zaroliagis","orcid":"https://orcid.org/0000-0003-1425-5138","observed_orcids":["https://orcid.org/0000-0003-1425-5138"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Christos Zaroliagis","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"Dorothea Wagnery","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Dorothea Wagnery","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"Thomas Willhalmy","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Thomas Willhalmy","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":null,"display_name":"Christos Zaroliagisz","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Christos Zaroliagisz","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.00734004,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.913100004196167,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.913100004196167,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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.03739999979734421,"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.029400000348687172,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/dijkstra-s-algorithm","display_name":"Dijkstra's algorithm","score":0.9110000133514404},{"id":"https://openalex.org/keywords/sparse-graphs","display_name":"sparse graphs","score":0.8370000123977661},{"id":"https://openalex.org/keywords/graph-layout","display_name":"graph layout","score":0.6679999828338623},{"id":"https://openalex.org/keywords/data-preprocessing","display_name":"data preprocessing","score":0.6959999799728394},{"id":"https://openalex.org/keywords/query-time","display_name":"query response time","score":0.7319999933242798},{"id":"https://openalex.org/keywords/geometric-objects","display_name":"geometric objects","score":0.44999998807907104}],"concepts":[{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.7460246086120605},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6961421370506287},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.619123637676239},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.5284623503684998},{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.5041717290878296},{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.4793618321418762},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.448030024766922},{"id":"https://openalex.org/C25321074","wikidata":"https://www.wikidata.org/wiki/Q1969601","display_name":"Pathfinding","level":4,"score":0.44255203008651733},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.43415576219558716},{"id":"https://openalex.org/C34736171","wikidata":"https://www.wikidata.org/wiki/Q918333","display_name":"Preprocessor","level":2,"score":0.4330317974090576},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.43268272280693054},{"id":"https://openalex.org/C182124507","wikidata":"https://www.wikidata.org/wiki/Q166154","display_name":"Line segment","level":2,"score":0.42750757932662964},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.18993186950683594}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.1.1745","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.1.1745","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.887.2129","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.887.2129","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"https://www.researchgate.net/profile/Christos_Zaroliagis/publication/36451225_Geometric_shortest_path_containers_online/links/53e256070cf216e8321a9338.pdf?origin%3Dpublication_detail","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":43,"referenced_works":["https://openalex.org/W27247825","https://openalex.org/W53500718","https://openalex.org/W79845460","https://openalex.org/W127515624","https://openalex.org/W136556473","https://openalex.org/W179323378","https://openalex.org/W205976932","https://openalex.org/W1480135873","https://openalex.org/W1537256577","https://openalex.org/W1545707055","https://openalex.org/W1549911051","https://openalex.org/W1554407673","https://openalex.org/W1556442714","https://openalex.org/W1561240874","https://openalex.org/W1567903304","https://openalex.org/W1572663059","https://openalex.org/W1601726608","https://openalex.org/W1649645444","https://openalex.org/W1673383737","https://openalex.org/W1847690346","https://openalex.org/W1861241110","https://openalex.org/W1953148806","https://openalex.org/W1982289281","https://openalex.org/W1982440947","https://openalex.org/W1989111470","https://openalex.org/W2011824721","https://openalex.org/W2022980325","https://openalex.org/W2024397934","https://openalex.org/W2029706450","https://openalex.org/W2049354208","https://openalex.org/W2061208844","https://openalex.org/W2073328808","https://openalex.org/W2084224084","https://openalex.org/W2094826544","https://openalex.org/W2095352457","https://openalex.org/W2096594665","https://openalex.org/W2101923813","https://openalex.org/W2115680394","https://openalex.org/W2129673493","https://openalex.org/W2139539792","https://openalex.org/W2168555292","https://openalex.org/W2169528473","https://openalex.org/W2405878055"],"related_works":["https://openalex.org/W2091812190","https://openalex.org/W7101137294","https://openalex.org/W6991342020","https://openalex.org/W7100966135","https://openalex.org/W4237172690","https://openalex.org/W2149964853","https://openalex.org/W7095691289","https://openalex.org/W7100660201","https://openalex.org/W7098145583","https://openalex.org/W2924923388"],"abstract_inverted_index":{"In":[0,64],"this":[1,70],"paper,":[2],"we":[3,67],"consider":[4],"Dijkstra's":[5],"algorithm":[6],"for":[7,28,75],"the":[8,25,37,40,50,60,65],"single":[9,11],"source":[10],"target":[12],"shortest":[13,87],"path":[14,88],"problem":[15],"in":[16,49],"large":[17],"sparse":[18],"graphs.":[19],"The":[20],"goal":[21],"is":[22,62],"to":[23,36],"reduce":[24],"response":[26],"time":[27],"on-line":[29],"queries":[30],"by":[31,85],"using":[32],"precomputed":[33],"information.":[34],"Due":[35],"size":[38],"of":[39,52,59],"graph,":[41],"preprocessing":[42],"space":[43],"requirements":[44],"can":[45,82],"be":[46,83],"only":[47],"linear":[48],"number":[51],"nodes.":[53],"We":[54],"assume":[55],"that":[56,81,91],"a":[57,72,86],"layout":[58,71],"graph":[61],"given.":[63],"preprocessing,":[66],"determine":[68],"from":[69],"geometric":[73],"object":[74],"each":[76],"edge":[77],"containing":[78],"all":[79],"nodes":[80],"reached":[84],"starting":[89],"with":[90],"edge.":[92]},"counts_by_year":[],"updated_date":"2026-11-08T12:12:28.789561","created_date":"2025-10-27T00:00:00"}