{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T08:40:01Z","timestamp":1725871201760},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319494654"},{"type":"electronic","value":"9783319494661"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-49466-1_4","type":"book-chapter","created":{"date-parts":[[2016,11,12]],"date-time":"2016-11-12T11:50:07Z","timestamp":1478951407000},"page":"49-58","source":"Crossref","is-referenced-by-count":0,"title":["Reconstruct Underground Infrastructure Networks Based on Uncertain Information"],"prefix":"10.1007","author":[{"given":"Marco","family":"de Koning","sequence":"first","affiliation":[]},{"given":"Frank","family":"Phillipson","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,11,13]]},"reference":[{"key":"4_CR1","doi-asserted-by":"crossref","first-page":"2129","DOI":"10.1016\/j.artint.2011.07.003","volume":"175","author":"H Aljazzar","year":"2011","unstructured":"Aljazzar, H., Leue, S.: K $$^*$$ : a heuristic search algorithm for finding the $$k$$ shortest paths. Artif. Intell. 175, 2129\u20132154 (2011). Elsevier","journal-title":"Artif. Intell."},{"issue":"4","key":"4_CR2","doi-asserted-by":"crossref","first-page":"582","DOI":"10.1137\/0108044","volume":"8","author":"R Bellman","year":"1960","unstructured":"Bellman, R., Kalaba, R.: On kth best policies. J. Soc. Ind. Appl. Math. 8(4), 582\u2013588 (1960)","journal-title":"J. Soc. Ind. Appl. Math."},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"Eppstein, D.: Finding the k shortest paths. In: 1994 Proceedings of 35th Annual Symposium on Foundations of Computer Science, pp. 154\u2013165. IEEE (1994)","DOI":"10.1109\/SFCS.1994.365697"},{"issue":"2","key":"4_CR4","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1109\/TSSC.1968.300136","volume":"4","author":"PE Hart","year":"1968","unstructured":"Hart, P.E., Nilsson, N.J., Raphael, B.: A formal basis for the heuristic determination of minimum cost paths. IEEE Trans. Syst. Sci. Cybern. 4(2), 100\u2013107 (1968)","journal-title":"IEEE Trans. Syst. Sci. Cybern."},{"issue":"4","key":"4_CR5","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1145\/1290672.1290682","volume":"3","author":"J Hershberger","year":"2007","unstructured":"Hershberger, J., Maxel, M., Suri, S.: Finding the k shortest simple paths: a new algorithm and its implementation. ACM Trans. Algorithms (TALG) 3(4), 45 (2007)","journal-title":"ACM Trans. Algorithms (TALG)"},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"Hershberger, J., Suri, S.: Vickrey prices and shortest paths: what is an edge worth? In: Proceedings of 42nd IEEE Symposium on Foundations of Computer Science, pp. 252\u2013259. IEEE (2001)","DOI":"10.1109\/SFCS.2001.959899"},{"issue":"4","key":"4_CR7","doi-asserted-by":"crossref","first-page":"506","DOI":"10.1145\/320998.321004","volume":"6","author":"W Hoffman","year":"1959","unstructured":"Hoffman, W., Pavley, R.: A method for the solution of the nth best path problem. J. ACM (JACM) 6(4), 506\u2013514 (1959)","journal-title":"J. ACM (JACM)"},{"key":"4_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/3-540-48318-7_4","volume-title":"Algorithm Engineering","author":"VM Jim\u00e9nez","year":"1999","unstructured":"Jim\u00e9nez, V.M., Marzal, A.: Computing the K shortest paths: a new algorithm and an experimental comparison. In: Vitter, J.S., Zaroliagis, C.D. (eds.) WAE 1999. LNCS, vol. 1668, pp. 15\u201329. Springer, Heidelberg (1999). doi: 10.1007\/3-540-48318-7_4"},{"key":"4_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/3-540-44867-5_14","volume-title":"Experimental and Efficient Algorithms","author":"VM Jim\u00e9nez","year":"2003","unstructured":"Jim\u00e9nez, V.M., Marzal, A.: A lazy version of Eppstein\u2019s K shortest paths algorithm. In: Jansen, K., Margraf, M., Mastrolilli, M., Rolim, J.D.P. (eds.) WEA 2003. LNCS, vol. 2647, pp. 179\u2013191. Springer, Heidelberg (2003). doi: 10.1007\/3-540-44867-5_14"},{"key":"4_CR10","doi-asserted-by":"crossref","unstructured":"Neumann, N., Phillipson, F.: Connecting points to a set of line segments in infrastructure design problems. In: 21st European Conference on Networks and Optical Communications (NOC 2016), Lisbon, Portugal (2016)","DOI":"10.1109\/NOC.2016.7507002"},{"issue":"1","key":"4_CR11","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1006\/jagm.2001.1201","volume":"42","author":"M Nyk\u00e4nen","year":"2002","unstructured":"Nyk\u00e4nen, M., Ukkonen, E.: The exact path length problem. J. Algorithms 42(1), 41\u201353 (2002)","journal-title":"J. Algorithms"},{"key":"4_CR12","unstructured":"Phillipson, F.: Efficient algorithms for infrastructure networks: planning issues and economic impact. Ph.D. thesis, VU Amsterdam (2014)"},{"issue":"11","key":"4_CR13","doi-asserted-by":"crossref","first-page":"712","DOI":"10.1287\/mnsc.17.11.712","volume":"17","author":"JY Yen","year":"1971","unstructured":"Yen, J.Y.: Finding the k shortest loopless paths in a network. Manag. Sci. 17(11), 712\u2013716 (1971)","journal-title":"Manag. Sci."}],"container-title":["Communications in Computer and Information Science","Innovations for Community Services"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-49466-1_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,25]],"date-time":"2017-06-25T03:27:43Z","timestamp":1498361263000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-49466-1_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319494654","9783319494661"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-49466-1_4","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2016]]}}}