{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:08:13Z","timestamp":1725516493896},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540691334"},{"type":"electronic","value":"9783540691341"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-69134-1_44","type":"book-chapter","created":{"date-parts":[[2008,8,12]],"date-time":"2008-08-12T12:07:43Z","timestamp":1218542863000},"page":"447-456","source":"Crossref","is-referenced-by-count":4,"title":["Aggregating Robots Compute: An Adaptive Heuristic for the Euclidean Steiner Tree Problem"],"prefix":"10.1007","author":[{"given":"Heiko","family":"Hamann","sequence":"first","affiliation":[]},{"given":"Heinz","family":"W\u00f6rn","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"44_CR1","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1145\/1052796.1052804","volume":"36","author":"S. Aaronson","year":"2005","unstructured":"Aaronson, S.: NP-complete problems and physical reality. ACM SIGACT News\u00a036(1), 30\u201352 (2005)","journal-title":"ACM SIGACT News"},{"key":"44_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 Univ. Press, Oxford (1999)"},{"key":"44_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1007\/3-540-45471-3_18","volume-title":"Algorithm Theory - SWAT 2002","author":"M. Chleb\u00edk","year":"2002","unstructured":"Chleb\u00edk, M., Chleb\u00edkov\u00e1, J.: Approximation hardness of the Steiner Tree problem on graphs. In: Penttonen, M., Schmidt, E.M. (eds.) SWAT 2002. LNCS, vol.\u00a02368, pp. 170\u2013179. Springer, Heidelberg (2002)"},{"key":"44_CR4","doi-asserted-by":"publisher","first-page":"1470","DOI":"10.1109\/CEC.1999.782657","volume-title":"Proceedings of the 1999 Congress on Evolutionary Computation (CEC 1999)","author":"M. Dorigo","year":"1999","unstructured":"Dorigo, M., Caro, G.D.: Ant Colony Optimization: A new meta-heuristic. In: Angeline, P.J., Michalewicz, Z., Schoenauer, M., Yao, X., Zalzala, A. (eds.) Proceedings of the 1999 Congress on Evolutionary Computation (CEC 1999), Piscataway, NJ, pp. 1470\u20131477. IEEE Press, Los Alamitos (1999)"},{"key":"44_CR5","doi-asserted-by":"crossref","unstructured":"Garey, M.R., Graham, R.L., Johnson, D.S.: Some NP-complete geometric problems. In: Annual ACM Symp. on Theory of Computing, pp. 10\u201322 (1976)","DOI":"10.1145\/800113.803626"},{"issue":"1","key":"44_CR6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s004540010071","volume":"25","author":"T.C. Hales","year":"2001","unstructured":"Hales, T.C.: The honeycomb conjecture. Discrete and Computational Geometry\u00a025(1), 1\u201322 (2001)","journal-title":"Discrete and Computational Geometry"},{"key":"44_CR7","unstructured":"Hamann, H.: Modeling and investigation of robot swarms. Master\u2019s thesis, University of Stuttgart, Germany (2006)"},{"issue":"3","key":"44_CR8","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1142\/S0129626407003022","volume":"17","author":"H. Hamann","year":"2007","unstructured":"Hamann, H., W\u00f6rn, H.: Embodied computation. Parallel Processing Letters\u00a017(3), 287\u2013298 (2007)","journal-title":"Parallel Processing Letters"},{"key":"44_CR9","unstructured":"Hofstadter, D.R.: G\u00f6del, Escher, Bach. Basic Books (1979)"},{"key":"44_CR10","volume-title":"The Steiner Tree Problem","author":"F.K. Hwang","year":"1992","unstructured":"Hwang, F.K., Richards, D.S., Winter, P.: The Steiner Tree Problem. North-Holland, Amsterdam (1992)"},{"issue":"8","key":"44_CR11","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1088\/0305-4470\/18\/8\/007","volume":"18","author":"M. Kolb","year":"1985","unstructured":"Kolb, M., Herrmann, H.J.: The sol-gel transition modelled by irreversible aggregation of clusters. J. Physics A\u00a018(8), L435\u2013L441 (1985)","journal-title":"J. Physics A"},{"key":"44_CR12","unstructured":"LaValle, S.M., Kuffner, J.J.: Rapidly-exploring random trees: Progress and prospects. In: Donald, B.R., Lynch, K.M., Rus, D. (eds.) Algorithmic and Computational Robotics, Wellesley, MA, USA, pp. 293\u2013308. A. K. Peters (2001)"},{"key":"44_CR13","doi-asserted-by":"crossref","unstructured":"Litus, Y., Zebrowski, P., Vaughan, R.: Energy-efficient multi-robot rendezvous: Parallel solutions by embodied approximation. In: Workshop on Algorithmic equivalencies between biological and robotic swarms, Atlanta, USA (June 2007)","DOI":"10.1109\/CRV.2007.27"},{"issue":"3","key":"44_CR14","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1023\/A:1012411712038","volume":"11","author":"D. Payton","year":"2001","unstructured":"Payton, D., Daily, M., Estowski, R., Howard, M., Lee, C.: Pheromone robotics. Autonomous Robots\u00a011(3), 319\u2013324 (2001)","journal-title":"Autonomous Robots"},{"key":"44_CR15","unstructured":"Robins, G., Zelikovsky, A.: Improved Steiner Tree approximation in graphs. In: 11th ACM-SIAM Symposium on Discrete Algorithms, pp. 770\u2013779 (2000)"},{"key":"44_CR16","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1007\/978-3-540-30552-1_7","volume-title":"Swarm Robotics Workshop","author":"J. Seyfried","year":"2005","unstructured":"Seyfried, J., Szymanski, M., Bender, N., Esta\u00f1a, R., Thiel, M., W\u00f6rn, H.: The I-SWARM project. In: \u015eahin, E., Spears, W.M. (eds.) Swarm Robotics Workshop, pp. 70\u201383. Springer, Heidelberg (2005)"},{"key":"44_CR17","first-page":"1400","volume":"19","author":"J. Tom","year":"1981","unstructured":"Tom, J., Witten, A., Sander, L.M.: Diffusion-limited aggregation, a kinetic critical phenomenon. Phys. Rev. Lett.\u00a019, 1400\u20131403 (1981)","journal-title":"Phys. Rev. Lett."},{"key":"44_CR18","unstructured":"Warme, D., Winter, P., Zachariasen, M.: Geosteiner homepage, http:\/\/www.diku.dk\/geosteiner\/"},{"key":"44_CR19","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1007\/PL00009287","volume":"25","author":"M. Zachariasen","year":"1999","unstructured":"Zachariasen, M., Winter, P.: Concatenation-based greedy heuristics for the Steiner tree problem in the Euclidean plane. Algorithmica\u00a025, 418\u2013437 (1999)","journal-title":"Algorithmica"}],"container-title":["Lecture Notes in Computer Science","From Animals to Animats 10"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-69134-1_44.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,14]],"date-time":"2021-09-14T13:50:03Z","timestamp":1631627403000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-69134-1_44"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540691334","9783540691341"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-69134-1_44","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}