{"id":"https://openalex.org/W2952050889","doi":"https://doi.org/10.1137/1.9781611974331.ch26","title":"Approximate Distance Oracles for Planar Graphs with Improved Query Time-Space Tradeoff","display_name":"Approximate Distance Oracles for Planar Graphs with Improved Query Time-Space Tradeoff","publication_year":2015,"publication_date":"2015-12-21","ids":{"openalex":"https://openalex.org/W2952050889","doi":"https://doi.org/10.1137/1.9781611974331.ch26","mag":"2952050889"},"language":"en","primary_location":{"id":"doi:10.1137/1.9781611974331.ch26","is_oa":true,"landing_page_url":"https://doi.org/10.1137/1.9781611974331.ch26","pdf_url":"https://epubs.siam.org/doi/pdf/10.1137/1.9781611974331.ch26","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://epubs.siam.org/doi/pdf/10.1137/1.9781611974331.ch26","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5077977985","display_name":"Christian Wulff\u2010Nilsen","orcid":"https://orcid.org/0000-0002-3699-7821"},"institutions":[{"id":"https://openalex.org/I124055696","display_name":"University of Copenhagen","ror":"https://ror.org/035b05819","country_code":"DK","type":"education","lineage":["https://openalex.org/I124055696"]}],"countries":["DK"],"is_corresponding":true,"raw_author_name":"Christian Wulff-Nilsen","raw_affiliation_strings":["Department of Computer Science, University of Copenhagen"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Copenhagen","institution_ids":["https://openalex.org/I124055696"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5077977985"],"corresponding_institution_ids":["https://openalex.org/I124055696"],"apc_list":null,"apc_paid":null,"fwci":1.817,"has_fulltext":false,"cited_by_count":15,"citation_normalized_percentile":{"value":0.87122711,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"351","last_page":"362"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":1.0,"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":1.0,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9997000098228455,"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/T12292","display_name":"Graph Theory and Algorithms","score":0.9986000061035156,"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/computer-science","display_name":"Computer science","score":0.7107492685317993},{"id":"https://openalex.org/keywords/planar","display_name":"Planar","score":0.5449889302253723},{"id":"https://openalex.org/keywords/space","display_name":"Space (punctuation)","score":0.4991734027862549},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.4514141380786896},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.37669074535369873},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.1495295763015747},{"id":"https://openalex.org/keywords/computer-graphics","display_name":"Computer graphics (images)","score":0.14303964376449585}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7107492685317993},{"id":"https://openalex.org/C134786449","wikidata":"https://www.wikidata.org/wiki/Q3391255","display_name":"Planar","level":2,"score":0.5449889302253723},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.4991734027862549},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.4514141380786896},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.37669074535369873},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.1495295763015747},{"id":"https://openalex.org/C121684516","wikidata":"https://www.wikidata.org/wiki/Q7600677","display_name":"Computer graphics (images)","level":1,"score":0.14303964376449585},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/1.9781611974331.ch26","is_oa":true,"landing_page_url":"https://doi.org/10.1137/1.9781611974331.ch26","pdf_url":"https://epubs.siam.org/doi/pdf/10.1137/1.9781611974331.ch26","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms","raw_type":"proceedings-article"},{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/8836e0e3-013d-4cec-a8b0-252701e56214","is_oa":false,"landing_page_url":"https://researchprofiles.ku.dk/da/publications/8836e0e3-013d-4cec-a8b0-252701e56214","pdf_url":null,"source":{"id":"https://openalex.org/S4306401983","display_name":"Research at the University of Copenhagen (University of Copenhagen)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I124055696","host_organization_name":"University of Copenhagen","host_organization_lineage":["https://openalex.org/I124055696"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Wulff-Nilsen , C 2016 , Approximate distance oracles for planar graphs with improved query time-space tradeoff . in R Krauthgamer (ed.) , 27th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016 . Association for Computing Machinery , pp. 351-362 , 27th Annual ACM-SIAM Symposium on Discrete Algorithms , Arlington , United States , 10/01/2016 . https://doi.org/10.1137/1.9781611974331.ch26","raw_type":"contributionToPeriodical"}],"best_oa_location":{"id":"doi:10.1137/1.9781611974331.ch26","is_oa":true,"landing_page_url":"https://doi.org/10.1137/1.9781611974331.ch26","pdf_url":"https://epubs.siam.org/doi/pdf/10.1137/1.9781611974331.ch26","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1503190306","https://openalex.org/W1551891681","https://openalex.org/W1582742149","https://openalex.org/W1601859867","https://openalex.org/W2003457914","https://openalex.org/W2038643780","https://openalex.org/W2045446569","https://openalex.org/W2069572385","https://openalex.org/W2074286662","https://openalex.org/W2090021115","https://openalex.org/W2091208704","https://openalex.org/W2096304547","https://openalex.org/W2108166877","https://openalex.org/W2284505917","https://openalex.org/W3101337733"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2899084033","https://openalex.org/W2748952813","https://openalex.org/W2390279801","https://openalex.org/W4391913857","https://openalex.org/W2358668433","https://openalex.org/W3216105633","https://openalex.org/W2019085620","https://openalex.org/W2990956612","https://openalex.org/W2584131233"],"abstract_inverted_index":{"We":[0],"consider":[1],"approximate":[2],"distance":[3,22],"oracles":[4,48],"for":[5],"edge-weighted":[6],"n-vertex":[7],"undirected":[8],"planar":[9],"graphs.":[10],"Given":[11],"fixed":[12],"\u220a":[13],">":[14],"0,":[15],"we":[16],"present":[17],"a":[18],"(1":[19],"+":[20],"\u220a)-approximate":[21],"oracle":[23],"with":[24],"O(n(log":[25,65],"log":[26,31,62,66],"n)2)":[27],"space":[28,45],"and":[29,44,56],"O((log":[30],"n)3)":[32],"query":[33,42],"time.":[34],"This":[35],"improves":[36],"the":[37,47],"previous":[38],"best":[39],"product":[40],"of":[41,46,49],"time":[43],"Thorup":[50],"(FOCS":[51],"2001,":[52],"J.":[53],"ACM":[54],"2004)":[55],"Klein":[57],"(SODA":[58],"2002)":[59],"from":[60],"O(n":[61],"n)":[63],"to":[64],"n)5).":[67]},"counts_by_year":[{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":4},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":3}],"updated_date":"2026-05-19T21:40:30.786675","created_date":"2025-10-10T00:00:00"}