文章基本信息
- 标题：Lower Bounds and Approximation Algorithms for Search Space Sizes in Contraction Hierarchies
- 本地全文：下载
- 作者：Johannes Blum ; Sabine Storandt
- 期刊名称：LIPIcs : Leibniz International Proceedings in Informatics
- 电子版ISSN：1868-8969
- 出版年度：2020
- 卷号：173
- 页码：20:1-20:14
- DOI：10.4230/LIPIcs.ESA.2020.20
- 出版社：Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik
- 摘要：Contraction hierarchies (CH) is a prominent preprocessing-based technique that accelerates the computation of shortest paths in road networks by reducing the search space size of a bidirectional Dijkstra run. To explain the practical success of CH, several theoretical upper bounds for the maximum search space size were derived in previous work. For example, it was shown that in minor-closed graph families search space sizes in ð'ª(â^Sn) can be achieved (with n denoting the number of nodes in the graph), and search space sizes in ð'ª(h log D) in graphs of highway dimension h and diameter D. In this paper, we primarily focus on lower bounds. We prove that the average search space size in a so called weak CH is in Ω(b_α) for α ⥠2/3 where b_α is the size of a smallest α-balanced node separator. This discovery allows us to describe the first approximation algorithm for the average search space size. Our new lower bound also shows that the ð'ª(â^Sn) bound for minor-closed graph families is tight. Furthermore, we deeper investigate the relationship of CH and the highway dimension and skeleton dimension of the graph, and prove new lower bound and incomparability results. Finally, we discuss how lower bounds for strong CH can be obtained from solving a HittingSet problem defined on a set of carefully chosen subgraphs of the input network.
- 关键词：contraction hierarchies; search space size; balanced separator; tree decomposition
