{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,3]],"date-time":"2026-06-03T07:24:13Z","timestamp":1780471453617,"version":"3.54.1"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2003,7,25]],"date-time":"2003-07-25T00:00:00Z","timestamp":1059091200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2003,11]]},"DOI":"10.1007\/s00453-003-1030-9","type":"journal-article","created":{"date-parts":[[2004,3,19]],"date-time":"2004-03-19T22:14:22Z","timestamp":1079734462000},"page":"165-186","source":"Crossref","is-referenced-by-count":87,"title":["A Distributed Ant Algorithm for\\protect Efficiently Patrolling a Network"],"prefix":"10.1007","volume":"37","author":[{"given":"Vladimir","family":"Yanovski","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Israel A.","family":"Wagner","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alfred M.","family":"Bruckstein","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2003,7,25]]},"reference":[{"key":"1030_CR1","unstructured":"Y. Afek, E. Gafni, Distributed"},{"key":"1030_CR2","doi-asserted-by":"crossref","unstructured":"R. Aleliunas, R. M. Karp, R. J. Lipton, L. Lov\u00e1sz, C. Rackoff, Random Walks, Universal Traversal Sequences and the Complexity of Maze Problems, Proceedings of the 20th Annual Symposium on Foundation of Computer Science, pp. 218\u2013223, 1979.","DOI":"10.1109\/SFCS.1979.34"},{"key":"1030_CR3","unstructured":"K. Knight, Are Many Reactive Agents Better than a Few Deliberative Ones, Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI), pp. 432\u2013437, 1993."},{"key":"1030_CR4","unstructured":"D. Hearn, M. Pauline Baker, Computer Graphics, Second Edition, Prentice Hall, 1994"},{"key":"1030_CR5","unstructured":"S. Koenig, Complexity of Edge Counting, in: Goal-Directed Acting with Incomplete Information, Technical Report CMU-CS-97-199, School of Computer Science, Carnegie Mellon University, November 1997."},{"key":"1030_CR6","unstructured":"S. Koenig, R. G. Simmons, Easy and Hard Testbeds for Real-Time Search Algorithms, Proceedings of the National Conference on Artificial Intelligence, pp. 279\u2013285, 1996."},{"issue":"1\/4","key":"1030_CR7","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1023\/A:1016665115585","volume":"31","author":"S. Koenig","year":"2001","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"1030_CR8","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0004-3702(90)90054-4","volume":"42","author":"R. E. Korf","year":"1992","journal-title":"Artificial Intelligence"},{"key":"1030_CR9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0019-9958(82)90344-8","volume":"55","author":"R. L. Rivest","year":"1982","journal-title":"Information and Control"},{"key":"1030_CR10","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1137\/0201010","volume":"1","author":"R. Tarjan","year":"1972","journal-title":"SIAM Journal on Computing"},{"key":"1030_CR11","doi-asserted-by":"crossref","unstructured":"I. A. Wagner and A. M. Bruckstein, Cooperative Cleaners - a Study in Ant Robotics, in: A. Paulraj, V. Roychowdhry, C. D. Schaper - ed., Communication, Computation, Control and Signal Processing: A Tribute to Thomas Kailath, Kluwer Academic Publishers, The Netherlands, 1997","DOI":"10.1007\/978-1-4615-6281-8_16"},{"key":"1030_CR12","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1023\/A:1018957401093","volume":"24","author":"I. A. Wagner","year":"1998","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"1030_CR13","unstructured":"I. A. Wagner, M. Lindenbaum, A. M. Bruckstein, Smell as a Computational Resource\u2014a Lesson We Can Learn from the Ants, Proceedings of ISTCS \u201896, Jerusalem, pp. 219\u2013230, 1996."},{"key":"1030_CR14","doi-asserted-by":"crossref","first-page":"918","DOI":"10.1109\/70.795795","volume":"15","author":"I. A. Wagner","year":"1999","journal-title":"IEEE Transactions on Robotics and Automation"},{"key":"1030_CR15","unstructured":"I. A. Wagner, M. Lindenbaum, A. M. Bruckstein, On-Line Graph Searching by a Smell-Oriented Vertex Process, AAAI-97, Workshop on On-Line Search, Providence, RI, 1997."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-003-1030-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-003-1030-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-003-1030-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T09:40:29Z","timestamp":1559122829000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-003-1030-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,7,25]]},"references-count":15,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2003,11]]}},"alternative-id":["1030"],"URL":"https:\/\/doi.org\/10.1007\/s00453-003-1030-9","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2003,7,25]]}}}