{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,11]],"date-time":"2025-01-11T05:37:54Z","timestamp":1736573874847,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540459071"},{"type":"electronic","value":"9783540459095"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11881223_56","type":"book-chapter","created":{"date-parts":[[2006,9,22]],"date-time":"2006-09-22T15:45:14Z","timestamp":1158939914000},"page":"456-465","source":"Crossref","is-referenced-by-count":0,"title":["Studies on Neighbourhood Graphs for Communication in Multi Agent Systems"],"prefix":"10.1007","author":[{"given":"Andreas","family":"Goebels","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"56_CR1","volume-title":"Multi-agent systems: An introduction to distributed artificial intelligence","author":"J. Ferber","year":"1999","unstructured":"Ferber, J.: Multi-agent systems: An introduction to distributed artificial intelligence. Addison-Wesley, Harlow (1999)"},{"key":"56_CR2","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780195131581.001.0001","volume-title":"Swarm Intelligence - From natural to artificial Systems","author":"E. Bonabeau","year":"1999","unstructured":"Bonabeau, E., Dorigo, M., Theraulaz, G.: Swarm Intelligence - From natural to artificial Systems. Oxford University Press, Oxford (1999)"},{"issue":"3","key":"56_CR3","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1080\/095281398146806","volume":"10","author":"M.J. Matari\u0107","year":"1998","unstructured":"Matari\u0107, M.J.: Using communication to reduce locality in distributed multi-agent learning. In: Weiss, G. (ed.) Journal of Experimental and Theoretical Artificial Intelligence, special issue on Learning in DAI Systems\u00a010(3), 357\u2013369 (1998)","journal-title":"Journal of Experimental and Theoretical Artificial Intelligence, special issue on Learning in DAI Systems"},{"key":"56_CR4","first-page":"38","volume":"7","author":"H.P. Nii","year":"1986","unstructured":"Nii, H.P.: Blackboard systems, part one: The blackboard model of problem solving and the evolution of blackboard architectures. AI Magazine\u00a07, 38\u201353 (1986)","journal-title":"AI Magazine"},{"key":"56_CR5","doi-asserted-by":"crossref","unstructured":"Gao, J., Guibas, L., Hershberger, J., Zhang, L., Zhu, A.: Geometric spanner for routing in mobile networks (2001)","DOI":"10.1145\/501422.501424"},{"key":"56_CR6","unstructured":"Eppstein, D.: Spanning trees and spanners. Technical Report Technical Report 96-16, University of California, Dept. Information and Computer Science (1996)"},{"key":"56_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"805","DOI":"10.1007\/978-3-540-30551-4_69","volume-title":"Algorithms and Computation","author":"C. Schindelhauer","year":"2004","unstructured":"Schindelhauer, C., Volbert, K., Ziegler, M.: Spanners, weak spanners, and power spanners for wireless networks. In: Fleischer, R., Trippen, G. (eds.) ISAAC 2004. LNCS, vol.\u00a03341, pp. 805\u2013821. Springer, Heidelberg (2004)"},{"key":"56_CR8","unstructured":"Goebels, A., B\u00fcning, H.K., Priesterjahn, S., Weimer, A.: Towards online partitioning of agent sets based on local information. In: Proceedings of the International Conference on Parallel and Distributed Computing and Networks (PDCN), Innsbruck, Austria (2005)"},{"key":"56_CR9","doi-asserted-by":"crossref","unstructured":"Goebels, A.: Learning useful communication structures for groups of agents. In: Proceedings of the IFIP Conference on Biologically Inspired Cooperative Computing, BICC 2006, Santiago de Chile, Chile (2006)","DOI":"10.1007\/978-0-387-34733-2_13"},{"key":"56_CR10","doi-asserted-by":"crossref","unstructured":"Eppstein, D., Paterson, M.S., Yao, F.F.: On nearest-neighbor graphs. GEOMETRY: Discrete & Computational Geometry 17 (1997)","DOI":"10.1007\/PL00009293"},{"key":"56_CR11","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/BF02187718","volume":"4","author":"P. Vaidya","year":"1989","unstructured":"Vaidya, P.: An O(n logn) algorithm for the all-nearest-neighbors problem. Discrete and Computational Geometry (4), 101\u2013115 (1989)","journal-title":"Discrete and Computational Geometry"},{"key":"56_CR12","doi-asserted-by":"crossref","unstructured":"Callahan, P.: Optimal parallel all-nearest-neighbours using the well-separated pair decomposition. In: Proceedings of the 34th IEEE Symposium Foundations of Computer Science, pp. 332\u2013340 (1993)","DOI":"10.1109\/SFCS.1993.366854"}],"container-title":["Lecture Notes in Computer Science","Advances in Natural Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11881223_56.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,10]],"date-time":"2025-01-10T23:40:22Z","timestamp":1736552422000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11881223_56"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540459071","9783540459095"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/11881223_56","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}