Concatenated <i>k</i>-path covers-Reference-Cited by-同舟云学术

Concatenated k-path covers

Published:2023-01-02 Issue:1 Volume:8 Page:32-56
ISSN:2379-9927
Container-title:International Journal of Computer Mathematics: Computer Systems Theory
language:en
Short-container-title:International Journal of Computer Mathematics: Computer Systems Theory

Author:

Beck Moritz¹,Lam Kam-Yiu²,Ng Joseph Kee Yin³,Storandt Sabine¹,Zhu Chun Jiang⁴

Affiliation:

1. Department of Computer and Information Science, University of Konstanz, Konstanz, Germany

2. Department of Computer Science, City University of Hong Kong, Kowloon Tong, Hong Kong

3. Department of Computer Science, Hong Kong Baptist University, Kowloon Tong, Hong Kong

4. University of Connecticut, Storrs, CT, USA

Publisher

Informa UK Limited

Subject

Computational Theory and Mathematics,Computational Mathematics

Link

https://www.tandfonline.com/doi/pdf/10.1080/23799927.2023.2173656

Reference20 articles.

1. I. Abraham, D. Delling, A. Fiat, A.V. Goldberg, and R.F. Werneck, VC-dimension and shortest path algorithms, in International Colloquium on Automata, Languages, and Programming, Springer, Zurich, Switzerland, 2011, pp. 690–699.

2. I. Abraham, D. Delling, A.V. Goldberg, and R.F. Werneck, Hierarchical hub labelings for shortest paths, in European Symposium on Algorithms, Ljubljana, Slovenia : Springer, 2012, pp. 24–35.

3. Alternative routes in road networks

4. T. Akiba, Y. Yano, and N. Mizuno, Hierarchical and Dynamic k-Path Covers, in Proceedings of the 25th ACM International on Conference on Information and Knowledge Management, New York, United States : ACM, 2016, pp. 1543–1552.

5. R. Bader, J. Dees, R. Geisberger, and P. Sanders, Alternative route graphs in road networks, in Theory and Practice of Algorithms in (Computer) Systems, Rome, Italy : Springer, 2011, pp. 21–32.