{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T11:26:52Z","timestamp":1760441212727,"version":"3.41.0"},"reference-count":14,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2014,6,9]],"date-time":"2014-06-09T00:00:00Z","timestamp":1402272000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["SIGACT News"],"published-print":{"date-parts":[[2014,6,9]]},"abstract":"<jats:p>This column is about patrolling problems in a geometric network. Mobile agents patrol a road network, and have to visit every point in the network as frequently as possible. The goal is finding a schedule that minimizes the idle time, i.e., the maximum time between two consecutive visits of some agent over all points in the network.<\/jats:p>","DOI":"10.1145\/2636805.2636822","type":"journal-article","created":{"date-parts":[[2014,6,24]],"date-time":"2014-06-24T12:16:16Z","timestamp":1403612176000},"page":"68-72","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["Computational geometry column 59"],"prefix":"10.1145","volume":"45","author":[{"given":"Adrian","family":"Dumitrescu","sequence":"first","affiliation":[{"name":"University of Wisconsin{Milwaukee"}]},{"given":"Csaba D.","family":"T\u00f3th","sequence":"additional","affiliation":[{"name":"California State University Northridge, Los Angeles, CA and Tufts University, Medford, MA"}]}],"member":"320","published-online":{"date-parts":[[2014,6,9]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2008.4543563"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.37236\/772"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.37236\/1602"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/1018422.1019876"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1016639210559"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2486159.2486176"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01832623"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-314X(84)90097-0"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/2040572.2040649"},{"key":"e_1_2_1_10_1","doi-asserted-by":"crossref","unstructured":"A. Dumitrescu A. Ghosh and Cs. D. T\u00f3th On fence patrolling by mobile agents preprint January 2014; arXiv:1401.6070.  A. Dumitrescu A. Ghosh and Cs. D. T\u00f3th On fence patrolling by mobile agents preprint January 2014; arXiv:1401.6070.","DOI":"10.37236\/4063"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2007.363817"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-35261-4_62"},{"key":"e_1_2_1_13_1","first-page":"155","volume-title":"3rd International Workshop on Multi-Agent-Based Simulation","author":"Machado A.","year":"2002","unstructured":"A. Machado , G. Ramalho , J. D. Zucker , and A. Drogoul , Multi-agent patrolling: an empirical analysis of alternative architectures , 3rd International Workshop on Multi-Agent-Based Simulation , Springer , 2002 , pp. 155 -- 170 . A. Machado, G. Ramalho, J. D. Zucker, and A. Drogoul, Multi-agent patrolling: an empirical analysis of alternative architectures, 3rd International Workshop on Multi-Agent-Based Simulation, Springer, 2002, pp. 155--170."},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01298332"}],"container-title":["ACM SIGACT News"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2636805.2636822","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2636805.2636822","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T20:14:35Z","timestamp":1750277675000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2636805.2636822"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,6,9]]},"references-count":14,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2014,6,9]]}},"alternative-id":["10.1145\/2636805.2636822"],"URL":"https:\/\/doi.org\/10.1145\/2636805.2636822","relation":{},"ISSN":["0163-5700"],"issn-type":[{"type":"print","value":"0163-5700"}],"subject":[],"published":{"date-parts":[[2014,6,9]]},"assertion":[{"value":"2014-06-09","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}