Efficient Algorithms for Euclidean Steiner Minimal Tree on Near-Convex Terminal Sets - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

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]

This author has not been identified. Look up 'Anubhav Dhar' in GoogleThis author has not been identified. Look up 'Soumita Hait' in GoogleThis author has not been identified. Look up 'Sudeshna Kolay' in Google

runs on WebDSL