The k-steiner ratio in graphs.
A Steiner minimum tree (SMT) is the shortest-length tree in a metric space interconnecting a set of points, called the regular points, possibly using additional vertices. A k-size Steiner minimum tree (kSMT) is one that can be split into components where all regular points are leaves and all compone...
| Vydáno v: | SIAM journal on computing. 26, 3 (1997). |
|---|---|
| Hlavní autor: | |
| Médium: | Článek |
| Jazyk: | English |
| Témata: |