{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T11:27:52Z","timestamp":1760441272943,"version":"3.40.3"},"publisher-location":"Cham","reference-count":9,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319181721"},{"type":"electronic","value":"9783319181738"}],"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-319-18173-8_19","type":"book-chapter","created":{"date-parts":[[2015,5,15]],"date-time":"2015-05-15T08:47:43Z","timestamp":1431679663000},"page":"261-273","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Simple Strategies Versus Optimal Schedules in Multi-agent Patrolling"],"prefix":"10.1007","author":[{"given":"Akitoshi","family":"Kawamura","sequence":"first","affiliation":[]},{"given":"Makoto","family":"Soejima","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,5,16]]},"reference":[{"key":"19_CR1","doi-asserted-by":"crossref","unstructured":"Chen, K., Dumitrescu, A., Ghosh, A.: On fence patrolling by mobile agents. In: Proc. 25th Canadian Conference on Computational Geometry (CCCG) (2013)","DOI":"10.37236\/4063"},{"key":"19_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1007\/978-3-642-23719-5_59","volume-title":"Algorithms \u2013 ESA 2011","author":"J Czyzowicz","year":"2011","unstructured":"Czyzowicz, J., G\u0105sieniec, L., Kosowski, A., Kranakis, E.: Boundary patrolling by mobile agents with distinct maximal speeds. In: Demetrescu, C., Halld\u00f3rsson, M.M. (eds.) ESA 2011. LNCS, vol. 6942, pp. 701\u2013712. Springer, Heidelberg (2011)"},{"key":"19_CR3","doi-asserted-by":"crossref","first-page":"P3.4","DOI":"10.37236\/4063","volume":"21","author":"A Dumitrescu","year":"2014","unstructured":"Dumitrescu, A., Ghosh, A., T\u00f3th, C.D.: On fence patrolling by mobile agents. Electronic Journal of Combinatorics 21, P3.4 (2014)","journal-title":"Electronic Journal of Combinatorics"},{"key":"19_CR4","doi-asserted-by":"crossref","unstructured":"Dumitrescu, A., T\u00f3th, C.D.: Computational Geometry Column 59. ACM SIGACT News 45(2) (2014)","DOI":"10.1145\/2636805.2636822"},{"key":"19_CR5","unstructured":"Garey, M., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman (1979)"},{"key":"19_CR6","doi-asserted-by":"crossref","unstructured":"Kawamura, A., Kobayashi, Y.: Fence patrolling by mobile agents with distinct speeds. Distributed Computing 28(2), 147\u2013154 (2015)","DOI":"10.1007\/s00446-014-0226-3"},{"key":"19_CR7","doi-asserted-by":"crossref","unstructured":"Kawamura, A., Soejima, M.: Simple strategies versus optimal schedules in multi-agent patrolling (2014). Preprint, arXiv:1411.6853","DOI":"10.1007\/978-3-319-18173-8_19"},{"issue":"3","key":"19_CR8","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1016\/0012-365X(92)90454-N","volume":"104","author":"Z Sun","year":"1992","unstructured":"Sun, Z.: On disjoint residue classes. Discrete Mathematics 104(3), 321\u2013326 (1992)","journal-title":"Discrete Mathematics"},{"issue":"3","key":"19_CR9","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/BF01350740","volume":"180","author":"\u0160 Zn\u00e1m","year":"1969","unstructured":"Zn\u00e1m, \u0160.: On exactly covering systems of arithmetic sequences. Mathematische Annalen 180(3), 227\u2013232 (1969)","journal-title":"Mathematische Annalen"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-18173-8_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,20]],"date-time":"2023-01-20T16:21:48Z","timestamp":1674231708000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-18173-8_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319181721","9783319181738"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-18173-8_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"16 May 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}