L
L. Berman
Researcher at IBM
Publications - 1
Citations - 1158
L. Berman is an academic researcher from IBM. The author has contributed to research in topics: K-ary tree & Gomory–Hu tree. The author has an hindex of 1, co-authored 1 publications receiving 1096 citations.
Papers
More filters
Journal ArticleDOI
A fast algorithm for Steiner trees
TL;DR: The heuristic algorithm has a worst case time complexity of O(¦S¦¦V¦2) on a random access computer and it guarantees to output a tree that spans S with total distance on its edges no more than 2(1−1/l) times that of the optimal tree.