Concatenated k-path covers

References

• 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.
   Google Scholar
• 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.
   Google Scholar
• I. Abraham, D. Delling, A.V. Goldberg, and R.F. Werneck, Alternative routes in road networks, J. Exp. Algorithmics 18 (2013), pp. 1–3.
   Google Scholar
• 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.
   Google Scholar
• 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.
   Google Scholar
• H. Bast, D. Delling, A. Goldberg, M. Müller-Hannemann, T. Pajor, P. Sanders, D. Wagner, and R.F. Werneck, Route planning in transportation networks. Algorithm engineering, pp. 19–80.
   Google Scholar
• H. Bast, S. Funke, D. Matijevic, P. Sanders, and D. Schultes, In transit to constant time shortest-path queries in road networks, in Proceedings of the Meeting on Algorithm Engineering & Experiments, Society for Industrial and Applied Mathematics, New Orleans, United States, 2007, pp. 46–59.
   Google Scholar
• M. Beck, K.Y. Lam, J.K.Y. Ng, S. Storandt, and C.J. Zhu, Concatenated k-path covers, in 2019 Proceedings of the Twenty-First Workshop on Algorithm Engineering and Experiments (ALENEX), San Diego, United States: SIAM, 2019, pp. 81–91.
   Google Scholar
• B. Brešar, F. Kardoš, J. Katrenič, and G. Semanišin, Minimum k-path vertex cover, Discrete Appl. Math. 159 (2011), pp. 1189–1195.
   Web of Science ®Google Scholar
• H. Brönnimann and M.T. Goodrich, Almost optimal set covers in finite vc-dimension, Discrete Comput. Geom. 14 (1995), pp. 463–479.
   Web of Science ®Google Scholar
• S. Funke, A. Nusser, and S. Storandt, On k-path covers and their applications, VLDB J. 25 (2016), pp. 103–123.
   Web of Science ®Google Scholar
• M.X. Goemans and D.P. Williamson, The primal–dual method for approximation algorithms and its application to network design problems. Approximation algorithms for NP-hard problems (1997), pp. 144–191.
   Google Scholar
• N. Ruan, R. Jin, and Y. Huang, Distance preserving graph simplification, in 2011 IEEE 11th International Conference on Data Mining, IEEE, 2011, pp. 1200–1205.
   Google Scholar
• E. Seo, P. Mohapatra, and T. Abdelzaher, Identifying rumors and their sources in social networks, in Ground/Air Multisensor Interoperability, Integration, and Networking for Persistent ISR III, Vol. 8389, International Society for Optics and Photonics, 2012, p. 83891I.
   Google Scholar
• S. Storandt and S. Funke, Enabling E-Mobility: Facility Location for Battery Loading Stations, in AAAI, Bellevue, United States , 2013.
   Google Scholar
• Y. Tao, C. Sheng, and J. Pei, On k-skip shortest paths, in Proceedings of the 2011 ACM SIGMOD International Conference on Management of data, Athens, Greece: ACM, 2011, pp. 421–432.
   Google Scholar
• V.N. Vapnik and A.Y. Chervonenkis, On the uniform convergence of relative frequencies of events to their probabilities, Theory Probab. Appl. 16 (1971), pp. 264–280.
   Web of Science ®Google Scholar
• X. Zhang and L. Chen, Distance-aware selective online query processing over large distributed graphs, Data Sci. Eng. 2 (2017), pp. 2–21.
   Google Scholar
• H. Zheng and J. Wu, Effective social network quarantine with minimal isolation costs, in Communications (ICC), 2016 IEEE International Conference on, IEEE, 2016, pp. 1–6.
   Google Scholar
• C.J. Zhu, K. Lam, J.K. Ng, and J. Bi, On the vc-dimension of unique round-trip shortest path systems, Inf. Process. Lett. 145 (2019), pp. 1–5.
   PubMed Web of Science ®Google Scholar