{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T02:50:52Z","timestamp":1725936652577},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319731162"},{"type":"electronic","value":"9783319731179"}],"license":[{"start":{"date-parts":[[2017,12,22]],"date-time":"2017-12-22T00:00:00Z","timestamp":1513900800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-73117-9_27","type":"book-chapter","created":{"date-parts":[[2017,12,21]],"date-time":"2017-12-21T16:45:34Z","timestamp":1513874734000},"page":"381-395","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Exploring Graphs with Time Constraints by\u00a0Unreliable Collections of Mobile Robots"],"prefix":"10.1007","author":[{"given":"Jurek","family":"Czyzowicz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maxime","family":"Godon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Evangelos","family":"Kranakis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arnaud","family":"Labourel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Euripides","family":"Markou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,12,22]]},"reference":[{"issue":"2","key":"27_CR1","doi-asserted-by":"crossref","first-page":"234","DOI":"10.1006\/inco.1993.1054","volume":"106","author":"R Baeza Yates","year":"1993","unstructured":"Baeza Yates, R., Culberson, J., Rawlins, G.: Searching in the plane. Inf. Comput. 106(2), 234\u2013252 (1993)","journal-title":"Inf. Comput."},{"key":"27_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/978-3-319-48314-6_13","volume-title":"Structural Information and Communication Complexity","author":"E Bampas","year":"2016","unstructured":"Bampas, E., Czyzowicz, J., G\u0105sieniec, L., Ilcinkas, D., Klasing, R., Kociumaka, T., Paj\u0105k, D.: Linear search by a pair of distinct-speed robots. In: Suomela, J. (ed.) SIROCCO 2016. LNCS, vol. 9988, pp. 195\u2013211. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-48314-6_13"},{"issue":"3","key":"27_CR3","doi-asserted-by":"crossref","first-page":"690","DOI":"10.1016\/j.ejor.2015.02.009","volume":"244","author":"S Bock","year":"2015","unstructured":"Bock, S.: Solving the traveling repairman problem on a line with general processing times and deadlines. Eur. J. Oper. Res. 244(3), 690\u2013703 (2015)","journal-title":"Eur. J. Oper. Res."},{"key":"27_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1007\/978-3-642-22450-8_27","volume-title":"Ad-hoc, Mobile, and Wireless Networks","author":"A Casteigts","year":"2011","unstructured":"Casteigts, A., Flocchini, P., Quattrociocchi, W., Santoro, N.: Time-varying graphs and dynamic networks. In: Frey, H., Li, X., Ruehrup, S. (eds.) ADHOC-NOW 2011. LNCS, vol. 6811, pp. 346\u2013359. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22450-8_27"},{"key":"27_CR5","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1007\/BFb0121091","volume":"26","author":"N Christofides","year":"1986","unstructured":"Christofides, N., Campos, V., Corber\u00e1n, A., Mota, E.: An algorithm for the rural postman problem on a directed graph. Math. Program. Study 26, 155\u2013166 (1986)","journal-title":"Math. Program. Study"},{"key":"27_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1007\/978-3-662-46078-8_14","volume-title":"SOFSEM 2015: Theory and Practice of Computer Science","author":"M Chrobak","year":"2015","unstructured":"Chrobak, M., G\u0105sieniec, L., Gorry, T., Martin, R.: Group search on the line. In: Italiano, G.F., Margaria-Steffen, T., Pokorn\u00fd, J., Quisquater, J.-J., Wattenhofer, R. (eds.) SOFSEM 2015. LNCS, vol. 8939, pp. 164\u2013176. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46078-8_14"},{"issue":"1","key":"27_CR7","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/0377-2217(94)90398-0","volume":"79","author":"A Corber\u00e1n","year":"1994","unstructured":"Corber\u00e1n, A., Sanchis, J.M.: A polyhedral approach to the rural postman problem. Eur. J. Oper. Res. 79(1), 95\u2013114 (1994)","journal-title":"Eur. J. Oper. Res."},{"key":"27_CR8","doi-asserted-by":"crossref","unstructured":"Czyzowicz, J., Georgiou, K., Kranakis, E., Krizanc, D., Narayanan, L., Opatrny, J., Shende, S.: Search on a line with Byzantine robots. In: ISAAC, LIPCS (2016)","DOI":"10.1007\/s00446-017-0296-0"},{"key":"27_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1007\/978-3-319-18173-8_10","volume-title":"Algorithms and Complexity","author":"J Czyzowicz","year":"2015","unstructured":"Czyzowicz, J., Georgiou, K., Kranakis, E., Narayanan, L., Opatrny, J., Vogtenhuber, B.: Evacuating robots from a disk using face-to-face communication (extended abstract). In: Paschos, V.T., Widmayer, P. (eds.) CIAC 2015. LNCS, vol. 9079, pp. 140\u2013152. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-18173-8_10"},{"key":"27_CR10","doi-asserted-by":"crossref","unstructured":"Czyzowicz, J., Kranakis, E., Krizanc, D., Narayanan, L., Opatrny, J.: Search on a line with faulty robots. In: PODC, pp. 405\u2013414 (2016)","DOI":"10.1145\/2933057.2933102"},{"issue":"2","key":"27_CR11","doi-asserted-by":"crossref","first-page":"342","DOI":"10.1016\/j.tcs.2006.05.018","volume":"361","author":"ED Demaine","year":"2006","unstructured":"Demaine, E.D., Fekete, S.P., Gal, S.: Online searching with turn cost. Theoret. Comput. Sci. 361(2), 342\u2013355 (2006)","journal-title":"Theoret. Comput. Sci."},{"issue":"3","key":"27_CR12","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1287\/opre.43.3.399","volume":"43","author":"HA Eiselt","year":"1995","unstructured":"Eiselt, H.A., Gendreau, M., Laporte, G.: Arc routing problems, part II: the rural postman problem. Oper. Res. 43(3), 399\u2013414 (1995)","journal-title":"Oper. Res."},{"key":"27_CR13","unstructured":"Flocchini, P.: Time-varying graphs and dynamic networks. In: 2015 Summer Solstice: 7th International Conference on Discrete Models of Complex Systems (2015)"},{"issue":"3","key":"27_CR14","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1016\/j.tcs.2008.02.040","volume":"399","author":"FV Fomin","year":"2008","unstructured":"Fomin, F.V., Thilikos, D.M.: An annotated bibliography on guaranteed graph searching. Theoret. Comput. Sci. 399(3), 236\u2013245 (2008)","journal-title":"Theoret. Comput. Sci."},{"issue":"3","key":"27_CR15","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1137\/0206029","volume":"6","author":"MR Garey","year":"1977","unstructured":"Garey, M.R., Johnson, D.S.: Two-processor scheduling with start-times and deadlines. SIAM J. Comput. 6(3), 416\u2013426 (1977)","journal-title":"SIAM J. Comput."},{"key":"27_CR16","volume-title":"Computers and Intractability","author":"MR Garey","year":"2002","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability, vol. 29. W. H. Freeman, New York (2002)"},{"key":"27_CR17","doi-asserted-by":"crossref","unstructured":"Holte, R., Mok, A., Rosier, L., Tulchinsky, I., Varvel, D.: The pinwheel: a real-time scheduling problem. In: Proceedings of the Twenty-Second Annual Hawaii International Conference on System Sciences. Software Track, vol. 2, pp. 693\u2013702. IEEE (1989). Also, in Handbook of Scheduling Algorithms, Models, and Performance Analysis. CRC Press (2004)","DOI":"10.1109\/HICSS.1989.48075"},{"issue":"3","key":"27_CR18","doi-asserted-by":"crossref","first-page":"434","DOI":"10.1016\/0196-6774(85)90012-4","volume":"6","author":"DS Johnson","year":"1985","unstructured":"Johnson, D.S.: The NP-completeness column: an ongoing guide. J. Algorithms 6(3), 434\u2013451 (1985)","journal-title":"J. Algorithms"},{"key":"27_CR19","doi-asserted-by":"crossref","unstructured":"Kuhn, F., Lynch, N., Oshman, R.: Distributed computation in dynamic networks. In: Proceedings of the Forty-Second ACM Symposium on Theory of Computing, pp. 513\u2013522. ACM (2010)","DOI":"10.1145\/1806689.1806760"},{"issue":"5","key":"27_CR20","doi-asserted-by":"crossref","first-page":"544","DOI":"10.1287\/mnsc.19.5.544","volume":"19","author":"EL Lawler","year":"1973","unstructured":"Lawler, E.L.: Optimal sequencing of a single machine subject to precedence constraints. Manag. Sci. 19(5), 544\u2013546 (1973)","journal-title":"Manag. Sci."},{"key":"27_CR21","unstructured":"Mitrovic-Minic, S., Krishnamurti, R.: The multiple traveling salesman problem with time windows: bounds for the minimum number of vehicles. Simon Fraser University TR-2002-11 (2002)"},{"issue":"3","key":"27_CR22","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1002\/net.3230220305","volume":"22","author":"JN Tsitsiklis","year":"1992","unstructured":"Tsitsiklis, J.N.: Special cases of traveling salesman and repairman problems with time windows. Networks 22(3), 263\u2013282 (1992)","journal-title":"Networks"},{"issue":"4","key":"27_CR23","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1002\/(SICI)1099-1425(199907\/08)2:4<175::AID-JOS24>3.0.CO;2-S","volume":"2","author":"GH Young","year":"1999","unstructured":"Young, G.H., Chan, C.-L.: Single-vehicle scheduling with time window constraints. J. Sched. 2(4), 175\u2013187 (1999)","journal-title":"J. Sched."}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2018: Theory and Practice of Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-73117-9_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,29]],"date-time":"2024-06-29T23:44:57Z","timestamp":1719704697000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-73117-9_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,12,22]]},"ISBN":["9783319731162","9783319731179"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-73117-9_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017,12,22]]}}}