### Abstract

Every rectilinear Steiner tree problem admits an optimal tree $T^*$ which is composed of \emph{tree stars}. Moreover, the currently fastest algorithms for the rectilinear Steiner tree problem proceed by composing an optimum tree $T^*$ from tree star components in the cheapest way. The efficiency of such algorithms depends heavily on the number of tree stars (candidate components). Fössmeier and Kaufmann (Algorithmica 26, 68–99, 2000) showed that any problem instance with $k$ terminals has a number of tree stars in between $1.32^k$ and $1.38^k$ (modulo polynomial factors) in the worst case. We determine the exact bound $O^*(\rho^k)$ where $\rho \approx 1.357$ and mention some consequences of this result.

Original language | Undefined |
---|---|

Pages (from-to) | 232-244 |

Number of pages | 13 |

Journal | Algorithmica |

Volume | 49 |

Issue number | 1/3 |

DOIs | |

Publication status | Published - Nov 2007 |

### Keywords

- EWI-11581
- IR-64538
- METIS-245864

## Cite this

Fuchs, B., Kern, W., & Wang, X. (2007). The Number of Tree Stars Is $O^*(1.357^k)$.

*Algorithmica*,*49*(1/3), 232-244. https://doi.org/10.1007/s00453-007-9020-y