{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,12]],"date-time":"2025-11-12T03:18:11Z","timestamp":1762917491872,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":36,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,7,23]],"date-time":"2013-07-23T00:00:00Z","timestamp":1374537600000},"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":[],"published-print":{"date-parts":[[2013,7,23]]},"DOI":"10.1145\/2486159.2486176","type":"proceedings-article","created":{"date-parts":[[2013,7,16]],"date-time":"2013-07-16T18:06:58Z","timestamp":1373998018000},"page":"241-250","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":22,"title":["Optimal patrolling of fragmented boundaries"],"prefix":"10.1145","author":[{"given":"Andrew","family":"Collins","sequence":"first","affiliation":[{"name":"University of Liverpool, Liverpool, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jurek","family":"Czyzowicz","sequence":"additional","affiliation":[{"name":"Universit\u00e9 du Qu\u00e9bec en Outaouais, Ottawa, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Leszek","family":"Gasieniec","sequence":"additional","affiliation":[{"name":"University of Liverpool, Liverpool, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Adrian","family":"Kosowski","sequence":"additional","affiliation":[{"name":"Inria Bordeaux Sud-Ouest, Bordeaux, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Evangelos","family":"Kranakis","sequence":"additional","affiliation":[{"name":"Carleton University, Ottawa, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Danny","family":"Krizanc","sequence":"additional","affiliation":[{"name":"Wesleyan University, Middletown, CT, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Russell","family":"Martin","sequence":"additional","affiliation":[{"name":"University of Liverpool, Liverpool, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Oscar","family":"Morales Ponce","sequence":"additional","affiliation":[{"name":"Chalmers University of Technology, Gothenburg, Sweden"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2013,7,23]]},"reference":[{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2008.4543563"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-28645-5_48"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(02)00502-1"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0218195993000063"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/1018422.1019876"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(88)90141-X"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02574671"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0255(92)90072-G"},{"key":"e_1_3_2_1_10_1","first-page":"459","volume-title":"SODA","author":"Czyzowicz J.","year":"1991","unstructured":"J. Czyzowicz , P. Egyed , H. Everett , D. Rappaport , T. C. Shermer , D. L. Souvaine , G. T. Toussaint , and J. Urrutia . The aquarium keeper's problem . In SODA , pages 459 -- 464 , 1991 . J. Czyzowicz, P. Egyed, H. Everett, D. Rappaport, T. C. Shermer, D. L. Souvaine, G. T. Toussaint, and J. Urrutia. The aquarium keeper's problem. In SODA, pages 459--464, 1991."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/2040572.2040649"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/780542.780612"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comgeo.2012.02.001"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2005.1570204"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-001-0040-8"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10472-010-9193-y"},{"key":"e_1_3_2_1_17_1","first-page":"63","volume-title":"AAMAS (1)","author":"Elmaliach Y.","year":"2008","unstructured":"Y. Elmaliach , A. Shiloni , and G. A. Kaminka . A realistic model of frequency-based multi-robot polyline patrolling . In AAMAS (1) , pages 63 -- 70 , 2008 . Y. Elmaliach, A. Shiloni, and G. A. Kaminka. A realistic model of frequency-based multi-robot polyline patrolling. In AAMAS (1), pages 63--70, 2008."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/1884958.1884970"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-009-9382-4"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2008.02.040"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2001.932890"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-11440-3_3"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.robot.2008.01.006"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-35261-4_62"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/IRDS.2002.1041701"},{"key":"e_1_3_2_1_26_1","first-page":"155","volume-title":"MABS","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 . In MABS , pages 155 -- 170 , 2002 . A. Machado, G. Ramalho, J.-D. Zucker, and A. Drogoul. Multi-agent patrolling: An empirical analysis of alternative architectures. In MABS, pages 155--170, 2002."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.5555\/1703775.1703989"},{"key":"e_1_3_2_1_28_1","first-page":"633","volume-title":"Chapter 15","author":"Mitchell J.","year":"2000","unstructured":"J. Mitchell . Geometric shortest paths and network optimization. In Handbook of Computational Geometry , Chapter 15 , pages 633 -- 701 , 2000 . J. Mitchell. Geometric shortest paths and network optimization. In Handbook of Computational Geometry, Chapter 15, pages 633--701, 2000."},{"key":"e_1_3_2_1_29_1","volume-title":"Lund U.","author":"Nilsson B. J.","year":"1995","unstructured":"B. J. Nilsson . Guarding art galleries; Methods for mobile guards. PhD thesis , Lund U. , Sweden , 1995 . B. J. Nilsson. Guarding art galleries; Methods for mobile guards. PhD thesis, Lund U., Sweden, 1995."},{"key":"e_1_3_2_1_30_1","first-page":"269","volume-title":"2nd Canadian Conf. Comput. Geometry","author":"Nilsson B. J.","year":"1990","unstructured":"B. J. Nilsson and D. Wood . Optimum watchmen route in spiral polygons . In 2nd Canadian Conf. Comput. Geometry , pages 269 -- 272 , 1990 . B. J. Nilsson and D. Wood. Optimum watchmen route in spiral polygons. In 2nd Canadian Conf. Comput. Geometry, pages 269--272, 1990."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0925-7721(99)00022-X"},{"key":"e_1_3_2_1_32_1","volume-title":"Art Gallery Theorems and Algorithms","author":"O'Rourke J.","year":"1987","unstructured":"J. O'Rourke . Art Gallery Theorems and Algorithms . Oxford University Press , 1987 . J. O'Rourke. Art Gallery Theorems and Algorithms. Oxford University Press, 1987."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.5555\/1788888.1788897"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2010.5717873"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1109\/5.163407"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-001-0045-3"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-003-1030-9"}],"event":{"name":"SPAA '13: 25th ACM Symposium on Parallelism in Algorithms and Architectures","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGARCH ACM Special Interest Group on Computer Architecture"],"location":"Montr\u00e9al Qu\u00e9bec Canada","acronym":"SPAA '13"},"container-title":["Proceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2486159.2486176","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2486159.2486176","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:28:53Z","timestamp":1750231733000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2486159.2486176"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,7,23]]},"references-count":36,"alternative-id":["10.1145\/2486159.2486176","10.1145\/2486159"],"URL":"https:\/\/doi.org\/10.1145\/2486159.2486176","relation":{},"subject":[],"published":{"date-parts":[[2013,7,23]]},"assertion":[{"value":"2013-07-23","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}