{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T22:28:10Z","timestamp":1725575290653},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540240594"},{"type":"electronic","value":"9783540305491"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30549-1_80","type":"book-chapter","created":{"date-parts":[[2011,1,16]],"date-time":"2011-01-16T14:26:55Z","timestamp":1295188015000},"page":"923-929","source":"Crossref","is-referenced-by-count":1,"title":["Applying Multi-medians Location and Steiner Tree Methods into Agents Distributed Blackboard Architecture Construction"],"prefix":"10.1007","author":[{"given":"Yi-Chuan","family":"Jiang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shi-Yong","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"unstructured":"Cyprian Foinjong Ngolah. A Tutorial on Agent Communication and Knowledge Sharing, \n                      \n                        http:\/\/www.enel.ucalgary.ca\/People\/far\/Lectures\/SENG60922\/PDF\/tutorials\/2002\/Agent_Communication_and_Knowledge_Sharing.pdf","key":"80_CR1"},{"key":"80_CR2","first-page":"79","volume-title":"Graph Theory: an algorithmic approach","author":"N. Christofides","year":"1975","unstructured":"Christofides, N.: Graph Theory: an algorithmic approach, pp. 79\u2013120. Academic Press, London (1975)"},{"key":"80_CR3","doi-asserted-by":"publisher","first-page":"955","DOI":"10.1287\/opre.16.5.955","volume":"16","author":"M.B. Teitz","year":"1968","unstructured":"Teitz, M.B., Bart, P.: Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph. Ops. Res.\u00a016, 955 (1968)","journal-title":"Ops. Res."},{"key":"80_CR4","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1287\/opre.11.3.331","volume":"11","author":"L. Cooper","year":"1963","unstructured":"Cooper, L.: Location Allocation problems. Ops.Res.\u00a011, 331 (1963)","journal-title":"Ops.Res."},{"unstructured":"Zachariasen, M.: Algorithms for Plane Steiner Tree Problems. Ph.d Thesis, University of Copenhagen, Denmark (1998)","key":"80_CR5"},{"unstructured":"Zhou, B.D.: Steiner Tree Optimization in Multicast Routing. M.S. Thesis [2002]. University of Guelph (July 2002)","key":"80_CR6"},{"doi-asserted-by":"crossref","unstructured":"Kou, L., Markowsky, G., Berman, L.: A Fast Algorithm for Steiner Trees. Acta Informatica. Vol.15 (1981)","key":"80_CR7","DOI":"10.1007\/BF00288961"}],"container-title":["Lecture Notes in Computer Science","AI 2004: Advances in Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30549-1_80.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,2]],"date-time":"2021-05-02T23:29:22Z","timestamp":1619998162000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30549-1_80"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540240594","9783540305491"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30549-1_80","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}