@InProceedings{dhar_et_al:LIPIcs.ISAAC.2023.25,
author = {Dhar, Anubhav and Hait, Soumita and Kolay, Sudeshna},
title = {{Efficient Algorithms for Euclidean Steiner Minimal Tree on Near-Convex Terminal Sets}},
booktitle = {34th International Symposium on Algorithms and Computation (ISAAC 2023)},
pages = {25:1--25:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-289-1},
ISSN = {1868-8969},
year = {2023},
volume = {283},
editor = {Iwata, Satoru and Kakimura, Naonori},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2023.25},
URN = {urn:nbn:de:0030-drops-193273},
doi = {10.4230/LIPIcs.ISAAC.2023.25},
annote = {Keywords: Steiner minimal tree, Euclidean Geometry, Almost Convex point sets, FPTAS, strong NP-completeness}
}