@inproceedings{e96aa4e0d6e5456482fc85edac7ae250,
title = "Obstacle-avoiding euclidean steiner trees by n-star bundles",
abstract = "Optimal topologies in networked systems is of relevant interest to integrate and coordinate multi-agency. Our interest in this paper is to compute the root location and the topology of minimal-length tree layouts given n nodes in a polygonal map, assuming an n-star network topology. Computational experiments involving 600 minimal tree planning scenarios show the feasibility and efficiency of the proposed approach.",
keywords = "Differential evolution, Edge bundling, Graphs, Minimal trees, Network optimization, Optimization, Path planning, Polygonal maps, Steiner trees",
author = "Victor Parque and Tomoyuki Miyashita",
note = "Funding Information: ACKNOWLEDGMENT We acknowledge the support from Kakenhi No. 15K18095 to fund this work. Also, we would like to thank Prof. Gautam Dasgupta for the helpful discussions and suggestions.; 30th International Conference on Tools with Artificial Intelligence, ICTAI 2018 ; Conference date: 05-11-2018 Through 07-11-2018",
year = "2018",
month = dec,
day = "13",
doi = "10.1109/ICTAI.2018.00057",
language = "English",
series = "Proceedings - International Conference on Tools with Artificial Intelligence, ICTAI",
publisher = "IEEE Computer Society",
pages = "315--319",
booktitle = "Proceedings - 2018 IEEE 30th International Conference on Tools with Artificial Intelligence, ICTAI 2018",
}