{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T03:58:21Z","timestamp":1743047901049,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319566597"},{"type":"electronic","value":"9783319566603"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-56660-3_46","type":"book-chapter","created":{"date-parts":[[2017,3,22]],"date-time":"2017-03-22T03:20:29Z","timestamp":1490152829000},"page":"537-547","source":"Crossref","is-referenced-by-count":1,"title":["Mobile Application for Calculation of Optimal Route Between Searched Points of Interest"],"prefix":"10.1007","author":[{"given":"Veronika","family":"Nemeckova","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jan","family":"Dvorak","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ondrej","family":"Krejcar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,3,23]]},"reference":[{"key":"46_CR1","unstructured":"Google Trends\u2014Tipy na d\u00e1rky: Google Trends. https:\/\/www.google.com\/trends\/explore#q=tipy%20na%20d%C3%A1rky . Accessed 28 Dec 2015"},{"key":"46_CR2","unstructured":"Google Trends\u2014Gift Ideas: Google Trends. https:\/\/www.google.com\/trends\/explore#q=gift%20ideas . Accessed 28 Dec 2015"},{"key":"46_CR3","unstructured":"Google Trends: https:\/\/www.google.cz\/trends\/ (2016). Accessed 28 Dec 2015"},{"key":"46_CR4","unstructured":"Grafy v Trendech: Google Trends. https:\/\/support.google.com\/trends\/answer\/4355164?hl=cs&ref_topic=4365530 (2016). Accessed 28 Dec 2015"},{"key":"46_CR5","doi-asserted-by":"publisher","unstructured":"Contreras-Bolton, C., Gatica, G., Barra, C.R., Parada, V.: A multi-operator genetic algorithm for the generalized minimum spanning tree problem. Expert Syst. Appl. 50, 1\u20138 (2016). doi: 10.1016\/j.eswa.2015.12.014","DOI":"10.1016\/j.eswa.2015.12.014"},{"key":"46_CR6","doi-asserted-by":"crossref","unstructured":"Moncla, L., Gaio, M., Nogueras-Iso, J., Musti\u00e9re, S.: Reconstruction of itineraries from annotated text with an informed spanning tree algorithm. Int. J. Geogr. Inf. Sci. 30(6) (2016)","DOI":"10.1080\/13658816.2015.1108422"},{"key":"46_CR7","doi-asserted-by":"crossref","unstructured":"Shangin, R., Pardalos, P.: Heuristics for the network design problem with connectivity requirements. J. Comb. Optim. 31(4), 1461\u20131478 (2016)","DOI":"10.1007\/s10878-015-9834-5"},{"key":"46_CR8","unstructured":"Boruvkuv algoritmus: Algoritmy.net. https:\/\/www.algoritmy.net\/article\/1396\/Boruvkuv-algoritmus . Accessed 30 Dec 2015"},{"key":"46_CR9","unstructured":"Sanjay Kumar, P.A.L.: Renovation of minimum spanning tree algorithms of weighted graph. http:\/\/ubiquity.acm.org\/article.cfm?id=1353566 . Accessed 30 Dec 2015"},{"key":"46_CR10","unstructured":"Jarnik - Primuv algoritmus: Algoritmy.net. https:\/\/www.algoritmy.net\/article\/1393\/Jarnik-Primuv-algoritmus . Accessed 30 Dec 2015"},{"key":"46_CR11","unstructured":"Computer Algorithms: Prim\u2019s Minimum Spanning Tree. Stoimen.com. http:\/\/www.stoimen.com\/blog\/2012\/11\/19\/computer-algorithms-prims-minimum-spanning-tree\/ . Accessed 30 Dec 2015"},{"key":"46_CR12","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1007\/978-3-319-40621-3_9","volume":"9768","author":"J Novotny","year":"2016","unstructured":"Novotny, J., Dvorak, J., Krejcar, O.: User based intelligent adaptation of five in a row game for android based on the data from the front camera. Lect. Notes Comput. Sci. LNCS 9768, 133\u2013149 (2016)","journal-title":"Lect. Notes Comput. Sci. LNCS"},{"key":"46_CR13","unstructured":"Computer Algorithms: Kruskal\u2019s Minimum Spanning Tree. Stoimen.com. http:\/\/www.stoimen.com\/blog\/2012\/11\/12\/computer-algorithms-kruskals-minimum-spanning-tree\/ . Accessed 30 Dec 2015"},{"key":"46_CR14","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/978-3-319-44215-0_10","volume":"9847","author":"J Novotny","year":"2016","unstructured":"Novotny, J., Dvorak, J., Krejcar, O.: Face-based difficulty adjustment for the game five in a row. Lect. Notes Comput. Sci. LNCS 9847, 121\u2013134 (2016)","journal-title":"Lect. Notes Comput. Sci. LNCS"},{"key":"46_CR15","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1007\/978-3-642-28490-8_43","volume":"6592","author":"M Behan","year":"2012","unstructured":"Behan, M., Krejcar, O.: Adaptive graphical user interface solution for modern user devices. Lect. Notes Comput. Sci. LNCS 6592, 411\u2013420 (2012)","journal-title":"Lect. Notes Comput. Sci. LNCS"},{"key":"46_CR16","first-page":"391","volume":"7197","author":"J Benikovsky","year":"2012","unstructured":"Benikovsky, J., Brida, P., Machaj, J.: Proposal of user adaptive modular localization system for ubiquitous positioning. LNCS 7197, 391\u2013400 (2012)","journal-title":"LNCS"},{"key":"46_CR17","first-page":"2013","volume":"155","author":"M Behan","year":"2013","unstructured":"Behan, M., Krejcar, O.: Modern smart device-based concept of sensoric networks. EURASIP J. Wirel. Commun. Netw. 2013(155) (2013)","journal-title":"EURASIP J. Wirel. Commun. Netw."}],"container-title":["Studies in Computational Intelligence","Advanced Topics in Intelligent Information and Database Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-56660-3_46","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,25]],"date-time":"2017-06-25T09:11:28Z","timestamp":1498381888000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-56660-3_46"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319566597","9783319566603"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-56660-3_46","relation":{},"ISSN":["1860-949X","1860-9503"],"issn-type":[{"type":"print","value":"1860-949X"},{"type":"electronic","value":"1860-9503"}],"subject":[],"published":{"date-parts":[[2017]]}}}