Login / Signup
Efficient Algorithms for Euclidean Steiner Minimal Tree on Near-Convex Terminal Sets.
Anubhav Dhar
Soumita Hait
Sudeshna Kolay
Published in:
ISAAC (2023)
Keyphrases
</>
convex sets
minimal subsets
convex constraints
steiner tree
minimum spanning tree
tree structure
tree models
index structure
convex optimization
multiscale
convex hull
tree structures
binary tree
finite dimensional
convex programming