{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T18:33:02Z","timestamp":1772908382731,"version":"3.50.1"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319123394","type":"print"},{"value":"9783319123400","type":"electronic"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-12340-0_3","type":"book-chapter","created":{"date-parts":[[2014,10,20]],"date-time":"2014-10-20T04:27:23Z","timestamp":1413779243000},"page":"29-41","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":16,"title":["DMVP: Foremost Waypoint Coverage of Time-Varying Graphs"],"prefix":"10.1007","author":[{"given":"Eric","family":"Aaron","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Danny","family":"Krizanc","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Elliot","family":"Meyerson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,10,21]]},"reference":[{"key":"3_CR1","doi-asserted-by":"crossref","unstructured":"Aaron, E., Kranakis, E., Krizanc, D.: On the complexity of the multi-robot, multi-depot map visitation problem. In: IEEE MASS, pp. 795\u2013800 (2011)","DOI":"10.1109\/MASS.2011.90"},{"key":"3_CR2","doi-asserted-by":"crossref","unstructured":"Aaron, E., Krizanc, D., Meyerson, E.: DMVP: foremost waypoint coverage of time-varying graphs (2014). http:\/\/arxiv.org\/abs\/1407.7279","DOI":"10.1007\/978-3-319-12340-0_3"},{"issue":"12","key":"3_CR3","doi-asserted-by":"publisher","first-page":"3403","DOI":"10.1016\/j.cor.2005.02.011","volume":"33","author":"D Ahr","year":"2006","unstructured":"Ahr, D., Reinhelt, G.: A tabu search algorithm for the min-max k-Chinese postman problem. Comput. Oper. Res. 33(12), 3403\u20133422 (2006)","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"3_CR4","first-page":"73","volume":"3","author":"T Akiyama","year":"1980","unstructured":"Akiyama, T., Nishizeki, T., Saito, N.: NP-completeness of the Hamiltonian cycle problem for bipartite graphs. J. Inf. Process. 3(2), 73\u201376 (1980)","journal-title":"J. Inf. Process."},{"issue":"1","key":"3_CR5","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/s00446-011-0133-9","volume":"24","author":"H Baumann","year":"2011","unstructured":"Baumann, H., Crescenzi, P., Fraigniaud, P.: Parsimonious flooding in dynamic graphs. Distrib. Comput. 24(1), 31\u201344 (2011)","journal-title":"Distrib. Comput."},{"issue":"1","key":"3_CR6","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1145\/321105.321111","volume":"9","author":"R Bellman","year":"1962","unstructured":"Bellman, R.: Dynamic programming treatment of the travelling salesman problem. JACM 9(1), 61\u201363 (1962)","journal-title":"JACM"},{"key":"3_CR7","doi-asserted-by":"crossref","unstructured":"Blum, A., Chalasani, P., Coppersmith, D., Pulleyblank, B., Raghavan, P., Sudan, M.: The minimum latency problem. In: Proceedings of 26th STOC, pp. 163\u2013171 (1994)","DOI":"10.1145\/195058.195125"},{"key":"3_CR8","series-title":"IFIP Advances in Information and Communication Technology","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/978-3-642-15240-5_9","volume-title":"Theoretical Computer Science","author":"A Casteigts","year":"2010","unstructured":"Casteigts, A., Flocchini, P., Mans, B., Santoro, N.: Deterministic computations in time-varying graphs: broadcasting under unstructured mobility. In: Calude, C.S., Sassone, V. (eds.) TCS 2010. IFIP AICT, vol. 323, pp. 111\u2013124. Springer, Heidelberg (2010)"},{"issue":"5","key":"3_CR9","first-page":"387","volume":"27","author":"A Casteigts","year":"2012","unstructured":"Casteigts, A., Flocchini, P., Quattrociocchi, W., Santoro, N.: Time-varying graphs and dynamic networks. IJPED 27(5), 387\u2013408 (2012)","journal-title":"IJPED"},{"key":"3_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/978-3-540-70575-8_11","volume-title":"Automata, Languages and Programming","author":"C Avin","year":"2008","unstructured":"Avin, C., Kouck\u00fd, M., Lotker, Z.: How to explore a fast-changing world (cover time of a simple random walk on evolving graphs). In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part I. LNCS, vol. 5125, pp. 121\u2013132. Springer, Heidelberg (2008)"},{"key":"3_CR11","first-page":"113","volume":"31","author":"H Choset","year":"2001","unstructured":"Choset, H.: Coverage for robotics: a survey of recent results. Ann. Math. AI 31, 113\u2013126 (2001)","journal-title":"Ann. Math. AI"},{"key":"3_CR12","unstructured":"Correll, N., Rutishauser, S., Martinoli, A.: Comparing coordination schemes for miniature robotic swarms. In: Springer Tracts in Advanced Robotics, vol. 39, pp. 471\u2013480 (2008)"},{"key":"3_CR13","doi-asserted-by":"crossref","unstructured":"Easton, K., Burdick, J.: A coverage algorithm for multi-robot boundary inspection. In: Proceedings of ICRA, pp. 727\u2013734 (2005)","DOI":"10.1109\/ROBOT.2005.1570204"},{"key":"3_CR14","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/BF01580113","volume":"5","author":"J Edmonds","year":"1973","unstructured":"Edmonds, J., Johnson, E.: Matching, Euler tours and the Chinese postman problem. Math. Program. 5, 88\u2013124 (1973)","journal-title":"Math. Program."},{"key":"3_CR15","unstructured":"Fakcharoenphol, J., Harrelson, C., Rao, S.: The k-traveling repairman problem. In: Proceedings of 39th STOC (2007)"},{"key":"3_CR16","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/j.tcs.2012.10.029","volume":"469","author":"P Flocchini","year":"2013","unstructured":"Flocchini, P., Mans, B., Santoro, N.: On the exploration of time-varying networks. Theor. Comput. Sci. 469, 53\u201368 (2013)","journal-title":"Theor. Comput. Sci."},{"key":"3_CR17","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M Garey","year":"1979","unstructured":"Garey, M., Johnson, D.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, New York (1979)"},{"issue":"4","key":"3_CR18","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1137\/0202019","volume":"2","author":"J Hopcroft","year":"1973","unstructured":"Hopcroft, J., Karp, R.: An $$n^{5\/2}$$ algorithm for maximum matchings in bipartite graphs. SIAM J. Comput. 2(4), 225\u2013231 (1973)","journal-title":"SIAM J. Comput."},{"key":"3_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1007\/978-3-642-25873-2_31","volume-title":"Principles of Distributed Systems","author":"D Ilcinkas","year":"2011","unstructured":"Ilcinkas, D., Wade, A.M.: On the power of waiting when exploring public transportation systems. In: Fern\u00e0ndez Anta, A., Lipari, G., Roy, M. (eds.) OPODIS 2011. LNCS, vol. 7109, pp. 451\u2013464. Springer, Heidelberg (2011)"},{"key":"3_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/978-3-319-03578-9_2","volume-title":"Structural Information and Communication Complexity","author":"D Ilcinkas","year":"2013","unstructured":"Ilcinkas, D., Wade, A.M.: Exploration of the T-interval-connected dynamic graphs: the case of the ring. In: Moscibroda, T., Rescigno, A.A. (eds.) SIROCCO 2013. LNCS, vol. 8179, pp. 13\u201323. Springer, Heidelberg (2013)"},{"key":"3_CR21","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations","author":"R Karp","year":"1972","unstructured":"Karp, R.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W. (eds.) Complexity of Computer Computations, pp. 85\u2013103. Plenum, New York (1972)"},{"key":"3_CR22","doi-asserted-by":"crossref","unstructured":"Kuhn, F., Lynch, N., Oshman, R.: Distributed computation in dynamic networks. In: ACM Symposium on Theory of Computing (2010)","DOI":"10.1145\/1806689.1806760"},{"issue":"1","key":"3_CR23","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1145\/1959045.1959064","volume":"42","author":"F Kuhn","year":"2011","unstructured":"Kuhn, F., Oshman, R.: Dynamic networks: models and algorithms. ACM SIGACT News 42(1), 82\u201396 (2011)","journal-title":"ACM SIGACT News"},{"key":"3_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/978-3-642-38768-5_32","volume-title":"Computing and Combinatorics","author":"B Mans","year":"2013","unstructured":"Mans, B., Mathieson, L.: On the treewidth of dynamic graphs. In: Du, D.-Z., Zhang, G. (eds.) COCOON 2013. LNCS, vol. 7936, pp. 349\u2013360. Springer, Heidelberg (2013)"},{"key":"3_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1007\/978-3-662-44465-8_47","volume-title":"Mathematical Foundations of Computer Science 2014","author":"O Michail","year":"2014","unstructured":"Michail, O., Spirakis, P.G.: Traveling salesman problems in temporal graphs. In: Csuhaj-Varj\u00fa, E., Dietzfelbinger, M., \u00c9sik, Z. (eds.) MFCS 2014, Part II. LNCS, vol. 8635, pp. 553\u2013564. Springer, Heidelberg (2014)"},{"issue":"5","key":"3_CR26","doi-asserted-by":"publisher","first-page":"918","DOI":"10.1109\/70.795795","volume":"15","author":"A Wagner","year":"1999","unstructured":"Wagner, A., Lindenbaum, M., Bruckstein, A.: Distributed covering by ant-robots using evaporating traces. IEEE Trans. Robot. Autom. 15(5), 918\u2013933 (1999)","journal-title":"IEEE Trans. Robot. Autom."},{"issue":"02","key":"3_CR27","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1142\/S0129054103001728","volume":"14","author":"B Xuan","year":"2003","unstructured":"Xuan, B., Ferreira, A., Jarry, A.: Computing shortest, fastest, and foremost journeys in dynamic networks. IJ Found. Comput. Sci. 14(02), 267\u2013285 (2003)","journal-title":"IJ Found. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-12340-0_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,5]],"date-time":"2025-05-05T06:38:16Z","timestamp":1746427096000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-12340-0_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319123394","9783319123400"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-12340-0_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"21 October 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}