{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,6]],"date-time":"2026-02-06T05:48:24Z","timestamp":1770356904524,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783662460177","type":"print"},{"value":"9783662460184","type":"electronic"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[[2015]]},"DOI":"10.1007\/978-3-662-46018-4_2","type":"book-chapter","created":{"date-parts":[[2015,1,3]],"date-time":"2015-01-03T14:51:00Z","timestamp":1420296660000},"page":"22-38","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Multi-Robot Foremost 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":[[2015,1,4]]},"reference":[{"key":"2_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":"2_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/978-3-319-12340-0_3","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"E Aaron","year":"2014","unstructured":"Aaron, E., Krizanc, D., Meyerson, E.: DMVP: Foremost waypoint coverage of time-varying graphs. In: Kratsch, D., Todinca, I. (eds.) WG 2014. LNCS, vol. 8747, pp. 29\u201341. Springer, Heidelberg (2014). http:\/\/www.univ-orleans.fr\/lifo\/evenements\/WG2014\/"},{"issue":"1","key":"2_CR3","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. Distr. Comp. 24(1), 31\u201344 (2011)","journal-title":"Distr. Comp."},{"issue":"3","key":"2_CR4","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/j.omega.2004.10.004","volume":"34","author":"T Bektas","year":"2006","unstructured":"Bektas, T.: The multiple traveling salesman problem: an overview of formulations and solution procedures. OMEGA 34(3), 209\u2013219 (2006)","journal-title":"OMEGA"},{"key":"2_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/978-3-540-39611-6_23","volume-title":"Ad-Hoc, Mobile, and Wireless Networks","author":"S Bhadra","year":"2003","unstructured":"Bhadra, S., Ferreira, A.: Complexity of connected components in evolving graphs and the computation of multicast trees in dynamic networks. In: Pierre, S., Barbeau, M., An, H.-C. (eds.) ADHOC-NOW 2003. LNCS, vol. 2865, pp. 259\u2013270. Springer, Heidelberg (2003)"},{"issue":"02","key":"2_CR6","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1142\/S0129054103001728","volume":"14","author":"B Bui-Xuan","year":"2003","unstructured":"Bui-Xuan, B., Ferreira, A., Jarry, A.: Computing shortest, fastest, and foremost journeys in dynamic networks. IJ Found. Comp. Sci. 14(02), 267\u2013285 (2003)","journal-title":"IJ Found. Comp. Sci."},{"key":"2_CR7","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":"2_CR8","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":"2_CR9","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":"2_CR10","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1023\/A:1016639210559","volume":"31","author":"H Choset","year":"2001","unstructured":"Choset, H.: Coverage for robotics - a survey of recent results. Ann. Math. Artif. Intell. 31, 113\u2013126 (2001)","journal-title":"Ann. Math. Artif. Intell."},{"key":"2_CR11","series-title":"Springer Tracts in Advanced Robotics","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1007\/978-3-540-77457-0_44","volume-title":"Experimental Robotics","author":"N Correll","year":"2008","unstructured":"Correll, N., Rutishauser, S., Martinoli, A.: Comparing coordination schemes for miniature robotic swarms: a case study in boundary coverage of regular structures. In: Khatib, O., Kumar, V., Rus, D. (eds.) Experimental Robotics. STAR, vol. 39, pp. 471\u2013480. Springer, Heidelberg (2008)"},{"key":"2_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/11682127_24","volume-title":"Architecture of Computing Systems - ARCS 2006","author":"M Dynia","year":"2006","unstructured":"Dynia, M., Korzeniowski, M., Schindelhauer, C.: Power-aware collective tree exploration. In: Grass, W., Sick, B., Waldschmidt, K. (eds.) ARCS 2006. LNCS, vol. 3894, pp. 341\u2013351. Springer, Heidelberg (2006)"},{"key":"2_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/11821069_29","volume-title":"Mathematical Foundations of Computer Science 2006","author":"M Dynia","year":"2006","unstructured":"Dynia, M., Kuty\u0142owski, J., der Heide, F.M., Schindelhauer, C.: Smart robot teams exploring sparse trees. In: Kr\u00e1lovi\u010d, R., Urzyczyn, P. (eds.) MFCS 2006. LNCS, vol. 4162, pp. 327\u2013338. Springer, Heidelberg (2006)"},{"key":"2_CR14","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":"2_CR15","doi-asserted-by":"crossref","unstructured":"Fakcharoenphol, J., Harrelson, C., Rao, S.: The $$k$$-traveling repairman problem. ACM Trans. Algorithms 3(4) (2007). http:\/\/dl.acm.org\/citation.cfm?doid=1290672.1290677","DOI":"10.1145\/1290672.1290677"},{"key":"2_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":"2_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)"},{"key":"2_CR18","doi-asserted-by":"crossref","unstructured":"Godard, E., Mazauric D.: Computing the dynamic diameter of non-deterministic dynamic networks is hard. In: Gao, J., Efrat, A., Fekete, S.P., Zhang, Y. (eds.) ALGOSENSORS 2014. LNCS, vol. 8847, pp. 88\u2013102. Springer, Heidelberg (2015)","DOI":"10.1007\/978-3-662-46018-4_6"},{"key":"2_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":"2_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":"2_CR21","doi-asserted-by":"crossref","unstructured":"Kuhn, F., Lynch, N., Oshman, R.: Distributed computation in dynamic networks. In: STOC, pp. 513\u2013522 (2010)","DOI":"10.1145\/1806689.1806760"},{"issue":"1","key":"2_CR22","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":"2_CR23","doi-asserted-by":"crossref","unstructured":"Kumar, S., Lai, T., Arora, A.: Barrier coverage with wireless sensors. In: ACM MobiCom, pp. 284\u2013298 (2005)","DOI":"10.1145\/1080829.1080859"},{"key":"2_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":"2_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":"1-3","key":"2_CR26","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/j.dam.2003.06.001","volume":"140","author":"H Nagamochi","year":"2004","unstructured":"Nagamochi, H., Okada, K.: A faster 2-approximation algorithm for the minmax p-traveling salesmen problem on a tree. Discrete Applied Math. 140(1-3), 103\u2013114 (2004)","journal-title":"Discrete Applied Math."},{"key":"2_CR27","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1016\/j.ejor.2012.12.023","volume":"227","author":"L Xu","year":"2013","unstructured":"Xu, L., Xu, Z., Xu, D.: Exact and approximation algorithms for the minmax k-traveling salesmen problem on a tree. EJOR 227, 284\u2013292 (2013)","journal-title":"EJOR"}],"container-title":["Lecture Notes in Computer Science","Algorithms for Sensor Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-46018-4_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,15]],"date-time":"2025-05-15T21:40:36Z","timestamp":1747345236000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-662-46018-4_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662460177","9783662460184"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-46018-4_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"4 January 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}