Matches in SemOpenAlex for { <https://semopenalex.org/work/W2088836486> ?p ?o ?g. }
Showing items 1 to 57 of
57
with 100 items per page.
- W2088836486 abstract "For some graph classes, most notably real-world road networks, shortest path queries can be answered very efficiently if the graph is preprocessed into a contraction hierarchy. The preprocessing algorithm contracts nodes in some order, adding new edges (shortcuts) in the process. While preprocessing and query algorithm work for any contraction ordering, it is desirable to use one that produces as few shortcuts as possible.It is known that the problem of minimizing the size (number of edges) of a given graph's contraction hierarchy is APX-hard. Also, any graph can be processed into a contraction hierarchy with at most O(nh log D) edges, where n, D, and h are the number of nodes, the diameter, and the highway dimension of the original graph, respectively.In this paper we show that the O(nh log D) bound is tight for a wide range of parameters n, D, and h. We also show that planar graphs, despite having highway dimension Ω(√n), can be preprocessed into a graph of size O(n log n). Finally, we present a simpler proof of APX-hardness." @default.
- W2088836486 created "2016-06-24" @default.
- W2088836486 creator A5002017225 @default.
- W2088836486 date "2012-11-06" @default.
- W2088836486 modified "2023-09-23" @default.
- W2088836486 title "On optimal preprocessing for contraction hierarchies" @default.
- W2088836486 cites W1594459318 @default.
- W2088836486 cites W2041172083 @default.
- W2088836486 cites W2070989606 @default.
- W2088836486 cites W2071717275 @default.
- W2088836486 cites W2113679823 @default.
- W2088836486 cites W2143083884 @default.
- W2088836486 doi "https://doi.org/10.1145/2442942.2442949" @default.
- W2088836486 hasPublicationYear "2012" @default.
- W2088836486 type Work @default.
- W2088836486 sameAs 2088836486 @default.
- W2088836486 citedByCount "16" @default.
- W2088836486 countsByYear W20888364862013 @default.
- W2088836486 countsByYear W20888364862014 @default.
- W2088836486 countsByYear W20888364862015 @default.
- W2088836486 countsByYear W20888364862016 @default.
- W2088836486 countsByYear W20888364862017 @default.
- W2088836486 countsByYear W20888364862020 @default.
- W2088836486 countsByYear W20888364862021 @default.
- W2088836486 crossrefType "proceedings-article" @default.
- W2088836486 hasAuthorship W2088836486A5002017225 @default.
- W2088836486 hasConcept C126322002 @default.
- W2088836486 hasConcept C154945302 @default.
- W2088836486 hasConcept C163415756 @default.
- W2088836486 hasConcept C34736171 @default.
- W2088836486 hasConcept C41008148 @default.
- W2088836486 hasConcept C71924100 @default.
- W2088836486 hasConcept C80444323 @default.
- W2088836486 hasConceptScore W2088836486C126322002 @default.
- W2088836486 hasConceptScore W2088836486C154945302 @default.
- W2088836486 hasConceptScore W2088836486C163415756 @default.
- W2088836486 hasConceptScore W2088836486C34736171 @default.
- W2088836486 hasConceptScore W2088836486C41008148 @default.
- W2088836486 hasConceptScore W2088836486C71924100 @default.
- W2088836486 hasConceptScore W2088836486C80444323 @default.
- W2088836486 hasLocation W20888364861 @default.
- W2088836486 hasOpenAccess W2088836486 @default.
- W2088836486 hasPrimaryLocation W20888364861 @default.
- W2088836486 hasRelatedWork W1597571772 @default.
- W2088836486 hasRelatedWork W1948541244 @default.
- W2088836486 hasRelatedWork W2018297885 @default.
- W2088836486 hasRelatedWork W2382928216 @default.
- W2088836486 hasRelatedWork W2384383430 @default.
- W2088836486 hasRelatedWork W2622473642 @default.
- W2088836486 hasRelatedWork W2624551785 @default.
- W2088836486 hasRelatedWork W2783233264 @default.
- W2088836486 hasRelatedWork W3107474891 @default.
- W2088836486 hasRelatedWork W4285211716 @default.
- W2088836486 isParatext "false" @default.
- W2088836486 isRetracted "false" @default.
- W2088836486 magId "2088836486" @default.
- W2088836486 workType "article" @default.