Aggregating Robots Compute: An Adaptive Heuristic for the Euclidean Steiner Tree Problem

Heiko Hamann, Heinz Wörn. Aggregating Robots Compute: An Adaptive Heuristic for the Euclidean Steiner Tree Problem. In Minoru Asada, John C. T. Hallam, Jean-Arcady Meyer, Jun Tani, editors, From Animals to Animats 10, 10th International Conference on Simulation of Adaptive Behavior, SAB 2008, Osaka, Japan, July 7-12, 2008. Proceedings. Volume 5040 of Lecture Notes in Computer Science, pages 447-456, Springer, 2008. [doi]

@inproceedings{HamannW08:0,
  title = {Aggregating Robots Compute: An Adaptive Heuristic for the Euclidean Steiner Tree Problem},
  author = {Heiko Hamann and Heinz Wörn},
  year = {2008},
  doi = {10.1007/978-3-540-69134-1_44},
  url = {http://dx.doi.org/10.1007/978-3-540-69134-1_44},
  researchr = {https://researchr.org/publication/HamannW08%3A0},
  cites = {0},
  citedby = {0},
  pages = {447-456},
  booktitle = {From Animals to Animats 10, 10th International Conference on Simulation of Adaptive Behavior, SAB 2008, Osaka, Japan, July 7-12, 2008. Proceedings},
  editor = {Minoru Asada and John C. T. Hallam and Jean-Arcady Meyer and Jun Tani},
  volume = {5040},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-540-69133-4},
}