Anubhav Dhar, Soumita Hait, Sudeshna Kolay. Efficient Algorithms for Euclidean Steiner Minimal Tree on Near-Convex Terminal Sets. In Satoru Iwata 0001, Naonori Kakimura, editors, 34th International Symposium on Algorithms and Computation, ISAAC 2023, December 3-6, 2023, Kyoto, Japan. Volume 283 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023. [doi]
@inproceedings{DharHK23,
title = {Efficient Algorithms for Euclidean Steiner Minimal Tree on Near-Convex Terminal Sets},
author = {Anubhav Dhar and Soumita Hait and Sudeshna Kolay},
year = {2023},
doi = {10.4230/LIPIcs.ISAAC.2023.25},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2023.25},
researchr = {https://researchr.org/publication/DharHK23},
cites = {0},
citedby = {0},
booktitle = {34th International Symposium on Algorithms and Computation, ISAAC 2023, December 3-6, 2023, Kyoto, Japan},
editor = {Satoru Iwata 0001 and Naonori Kakimura},
volume = {283},
series = {LIPIcs},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
isbn = {978-3-95977-289-1},
}