Faster exact algorithms for steiner tree
โ
Marshall Bern
๐
Article
๐
1990
๐
John Wiley and Sons
๐
English
โ 739 KB
We improve the time and space complexities of dynamic programming algorithms that compute optimal Steiner trees spanning nodes in planar networks. Our algorithms have special application to the rectilinear Steiner problem.