skip to main content
10.1145/2983323.2983712acmconferencesArticle/Chapter ViewAbstractPublication PagescikmConference Proceedingsconference-collections
research-article

Hierarchical and Dynamic k-Path Covers

Published: 24 October 2016 Publication History

Abstract

A metric-independent data structure for spatial networks called k-all-path cover (k-APC) has recently been proposed. It involves a set of vertices that covers all paths of size k, and is a general indexing technique that can accelerate various path-related processes on spatial networks, such as route planning and path subsampling to name a few. Although it is a promising tool, it currently has drawbacks pertaining to its construction and maintenance. First, k-APCs, especially for large values of k, are computationally too expensive. Second, an important factor related to quality is ignored by a prevalent construction algorithm. Third, an existing algorithm only focuses on static networks.
To address these issues, we propose novel k-APC construction and maintenance algorithms. Our algorithms recursively construct the layers of APCs, which we call the k-all-path cover hierarchy, by using vertex cover heuristics. This allows us to extract k-APCs for various values of k from the hierarchy. We also devise an algorithm to maintain k-APC hierarchies on dynamic networks. Our experiments showed that our construction algorithm can yield high solution quality, and has a short running time for large values of k. They also verified that our dynamic algorithm can handle an edge weight change within 40 ms.

References

[1]
I. Abraham, D. Delling, A. Fiat, A. V. Goldberg, and R. F. Werneck. Vc-dimension and shortest path algorithms. In ICALP, pages 690--699, 2011.
[2]
I. Abraham, D. Delling, A. V. Goldberg, and R. F. Werneck. A hub-based labeling algorithm for shortest paths in road networks. In Experimental Algorithms, pages 230--241. 2011.
[3]
T. Akiba, Y. Iwata, K.-i. Kawarabayashi, and Y. Kawata. Fast shortest-path distance queries on road networks by pruned highway labeling. In ALENEX, pages 147--154, 2014.
[4]
E. Angel, R. Campigotto, and C. Laforest. Implementation and comparison of heuristics for the vertex cover problem on huge graphs. In Experimental Algorithms, pages 39--50. 2012.
[5]
B. Brešar, F. Kardoš, K. Katrenič, and G. Semanišin. Minimum k-path vertex cover. Discrete Applied Mathematics, 159(12):1189--1195, 2011.
[6]
F. Bruera, S. Cicerone, G. D'Angelo, G. D. Stefano, and D. Frigioni. Dynamic multi-level overlay graphs for shortest paths. Mathematics in Computer Science, 1(4):709--736, 2008.
[7]
J. Cheng, Z. Shang, H. Cheng, H. Wang, and J. X. Yu. K-reach: Who is in your small world. PVLDB, 5(11):1292--1303, 2012.
[8]
D. Delling, A. V. Goldberg, T. Pajor, and R. F. Werneck. Customizable route planning. In SEA, pages 376--387, 2011.
[9]
S. Funke, A. Nusser, and S. Storandt. On k-path covers and their applications. PVLDB, 7(10):893--902, 2014. Best Paper Award.
[10]
S. Funke and S. Storandt. Polynomial-time construction of contraction hierarchies for multi-criteria objectives. In ALENEX, pages 41--54, 2013.
[11]
S. Funke and S. Storandt. Personalized route planning in road networks. In SIGSPATIAL, 2015.
[12]
R. Geisberger, P. Sanders, D. Schultes, and D. Delling. Contraction hierarchies: Faster and simpler hierarchical routing in road networks. In Experimental Algorithms, pages 319--333. 2008.
[13]
M. Holzer, F. Schulz, and D. Wagner. Engineering multilevel overlay graphs for shortest-path queries. ACM Journal of Experimental Algorithmics, 13(2.5):1--26, 2008.
[14]
F. Kardoš, J. Katrenič, and I. Schiermeyer. On computing the minimum 3-path vertex cover and dissociation number of graphs. Theoretical Computer Science, 412(50):7009--7017, 2011.
[15]
Y. Tao, C. Sheng, and J. Pei. On k-skip shortest paths. In SIGMOD, pages 421--432, 2011.

Cited By

View all
  • (2023) Concatenated k -path covers International Journal of Computer Mathematics: Computer Systems Theory10.1080/23799927.2023.21736568:1(32-56)Online publication date: 15-Feb-2023
  • (2018)Real-time constrained cycle detection in large dynamic graphsProceedings of the VLDB Endowment10.14778/3229863.322987411:12(1876-1888)Online publication date: 1-Aug-2018

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
CIKM '16: Proceedings of the 25th ACM International on Conference on Information and Knowledge Management
October 2016
2566 pages
ISBN:9781450340731
DOI:10.1145/2983323
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 24 October 2016

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. graphs
  2. indexing
  3. road networks
  4. route planning
  5. spatial networks

Qualifiers

  • Research-article

Conference

CIKM'16
Sponsor:
CIKM'16: ACM Conference on Information and Knowledge Management
October 24 - 28, 2016
Indiana, Indianapolis, USA

Acceptance Rates

CIKM '16 Paper Acceptance Rate 160 of 701 submissions, 23%;
Overall Acceptance Rate 1,861 of 8,427 submissions, 22%

Upcoming Conference

CIKM '25

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)17
  • Downloads (Last 6 weeks)0
Reflects downloads up to 17 Jan 2025

Other Metrics

Citations

Cited By

View all
  • (2023) Concatenated k -path covers International Journal of Computer Mathematics: Computer Systems Theory10.1080/23799927.2023.21736568:1(32-56)Online publication date: 15-Feb-2023
  • (2018)Real-time constrained cycle detection in large dynamic graphsProceedings of the VLDB Endowment10.14778/3229863.322987411:12(1876-1888)Online publication date: 1-Aug-2018

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media