{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T08:51:40Z","timestamp":1758271900125},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2015,7,14]],"date-time":"2015-07-14T00:00:00Z","timestamp":1436832000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["The VLDB Journal"],"published-print":{"date-parts":[[2016,2]]},"DOI":"10.1007\/s00778-015-0392-3","type":"journal-article","created":{"date-parts":[[2015,7,13]],"date-time":"2015-07-13T02:58:13Z","timestamp":1436756293000},"page":"103-123","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["On k-Path Covers and their applications"],"prefix":"10.1007","volume":"25","author":[{"given":"Stefan","family":"Funke","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andr\u00e9","family":"Nusser","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sabine","family":"Storandt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,7,14]]},"reference":[{"key":"392_CR1","doi-asserted-by":"crossref","unstructured":"Abraham, I., Delling, D., Fiat, A., Goldberg, A.V., Werneck, R.F.: VC-dimension and shortest path algorithms. In: International Colloquium on Automata, Languages, and Programming (ICALP), pp. 690\u2013699. Springer, Berlin (2011)","DOI":"10.1007\/978-3-642-22006-7_58"},{"key":"392_CR2","doi-asserted-by":"crossref","unstructured":"Abraham, I., Delling, D., Goldberg, A.V., Werneck, R.F.: A hub-based labeling algorithm for shortest paths in road networks. In: Symposium on Experimental Algorithms (SEA), pp. 230\u2013241. Springer, Berlin (2011)","DOI":"10.1007\/978-3-642-20662-7_20"},{"issue":"5824","key":"392_CR3","doi-asserted-by":"crossref","first-page":"566","DOI":"10.1126\/science.1137521","volume":"316","author":"H Bast","year":"2007","unstructured":"Bast, H., Funke, S., Sanders, P., Schultes, D.: Fast routing in road networks using transit nodes. Science 316(5824), 566 (2007)","journal-title":"Science"},{"issue":"12","key":"392_CR4","doi-asserted-by":"crossref","first-page":"1189","DOI":"10.1016\/j.dam.2011.04.008","volume":"159","author":"B Bre\u0161ar","year":"2011","unstructured":"Bre\u0161ar, B., Kardo\u0161, F., Katreni\u010d, J., Semani\u0161in, G.: Minimum k-path vertex cover. Discrete Appl. Math. 159(12), 1189\u20131195 (2011)","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"392_CR5","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1007\/BF02570718","volume":"14","author":"H Br\u00f6nnimann","year":"1995","unstructured":"Br\u00f6nnimann, H., Goodrich, M.T.: Almost optimal set covers in finite VC-dimension. Discrete Comput. Geom. 14(1), 463\u2013479 (1995)","journal-title":"Discrete Comput. Geom."},{"key":"392_CR6","doi-asserted-by":"crossref","unstructured":"Delling, D., Goldberg, A.V., Pajor, T., Werneck, R.F.F.: Customizable route planning. In: Symposium on Experimental Algorithms (SEA), pp. 376\u2013387. Springer, Berlin (2011)","DOI":"10.1007\/978-3-642-20662-7_32"},{"key":"392_CR7","doi-asserted-by":"crossref","unstructured":"Delling, D., Kobitzsch, M., Werneck, R.: Customizing driving directions with GPUs. In: Euro-Par Parallel Processing, vol. 8632, pp. 728\u2013739. Springer, Berlin (2014)","DOI":"10.1007\/978-3-319-09873-9_61"},{"key":"392_CR8","first-page":"10","volume":"6","author":"J Dibbelt","year":"2012","unstructured":"Dibbelt, J., Pajor, T., Wagner, D.: User-constrained multi-modal route planning. Networks 6, 10 (2012)","journal-title":"Networks"},{"key":"392_CR9","doi-asserted-by":"crossref","unstructured":"Dibbelt, J., Strasser, B., Wagner, D.: Customizable contraction hierarchies. arXiv preprint arXiv:1402.0402 (2014)","DOI":"10.1007\/978-3-319-07959-2_38"},{"key":"392_CR10","doi-asserted-by":"crossref","unstructured":"Funke, S., Nusser, A., Storandt, S.: On k-path covers and their applications. PVLDB 7(10), 893\u2013902 (2014). http:\/\/www.vldb.org\/pvldb\/vol7\/p893-funke.pdf","DOI":"10.14778\/2732951.2732963"},{"key":"392_CR11","doi-asserted-by":"crossref","unstructured":"Funke, S., Storandt, S.: Polynomial-time construction of contraction hierarchies for multi-criteria objectives. In: Sanders, P., Norbert, Z. (eds) Algorithm Engineering and Experiments (ALENEX), pp. 41\u201354. SIAM (2013)","DOI":"10.1137\/1.9781611972931.4"},{"key":"392_CR12","doi-asserted-by":"crossref","unstructured":"Geisberger, R., Sanders, P., Schultes, D., Vetter, C.: Exact routing in large road networks using contraction hierarchies. Transp. Sci. 46(3), 388\u2013404 (2012)","DOI":"10.1287\/trsc.1110.0401"},{"key":"392_CR13","unstructured":"Gutman, R.J.: Reach-based routing: a new approach to shortest path algorithms optimized for road networks. In: Lars, A., Giuseppe, F.I., Robert, S. (eds) Algorithm Engineering and Experiments (ALENEX), pp. 100\u2013111 (2004)"},{"key":"392_CR14","doi-asserted-by":"crossref","unstructured":"Haussler, D., Welzl, E.: Epsilon-nets and simplex range queries. In: Symposium on Computational Geometry (SCG), pp. 61\u201371. ACM (1986)","DOI":"10.1145\/10515.10522"},{"key":"392_CR15","doi-asserted-by":"crossref","unstructured":"Khot, S.: On the power of unique 2-prover 1-round games. In: Proceedings of the Thiry-fourth Annual ACM Symposium on Theory of Computing. STOC \u201902, pp. 767\u2013775. ACM, New York, NY (2002)","DOI":"10.1145\/509907.510017"},{"issue":"3","key":"392_CR16","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1016\/j.jcss.2007.06.019","volume":"74","author":"S Khot","year":"2008","unstructured":"Khot, S., Regev, O.: Vertex cover might be hard to approximate to within 2- $$\\varepsilon $$ \u03b5 . J. Comput. Syst. Sci. 74(3), 335\u2013349 (2008)","journal-title":"J. Comput. Syst. Sci."},{"key":"392_CR17","doi-asserted-by":"crossref","unstructured":"Ruan, N., Jin, R., Huang, Y.: Distance preserving graph simplification. In: Data Mining (ICDM), 2011 IEEE 11th International Conference on, pp. 1200\u20131205. IEEE (2011)","DOI":"10.1109\/ICDM.2011.57"},{"key":"392_CR18","doi-asserted-by":"crossref","unstructured":"Tao, Y., Sheng, C., Pei, J.: On k-skip shortest paths. In: ACM SIGMOD International Conference on Management of Data, pp. 421\u2013432. ACM (2011)","DOI":"10.1145\/1989323.1989368"},{"issue":"2","key":"392_CR19","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1137\/1116025","volume":"16","author":"VN Vapnik","year":"1971","unstructured":"Vapnik, V.N., Chervonenkis, A.Y.: On the uniform convergence of relative frequencies of events to their probabilities. Theory Probab. Appl. 16(2), 264\u2013280 (1971)","journal-title":"Theory Probab. Appl."}],"container-title":["The VLDB Journal"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-015-0392-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00778-015-0392-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-015-0392-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,28]],"date-time":"2019-08-28T01:12:12Z","timestamp":1566954732000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00778-015-0392-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,7,14]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2016,2]]}},"alternative-id":["392"],"URL":"https:\/\/doi.org\/10.1007\/s00778-015-0392-3","relation":{},"ISSN":["1066-8888","0949-877X"],"issn-type":[{"value":"1066-8888","type":"print"},{"value":"0949-877X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,7,14]]}}}