### Abstract

In this paper, we study the Steiner tree problem with minimum number of Steiner points and bounded edge-length (STP-MSPBEL), which asks for a tree interconnecting a given set of n terminal points and a minimum number of Steiner points such that the Euclidean length of each edge is no more than a given positive constant. This problem has applications in VLSI design, WDM optimal networks and wireless communications. We prove that this problem is NP-complete and present a polynomial time approximation algorithm whose worst-case performance ratio is 5.

Original language | English (US) |
---|---|

Pages (from-to) | 53-57 |

Number of pages | 5 |

Journal | Information Processing Letters |

Volume | 69 |

Issue number | 2 |

State | Published - Jan 29 1999 |

Externally published | Yes |

### Keywords

- Algorithms
- Approximation algorithms
- Steiner minimum trees
- VLSI design
- WDM optimal networks
- Wireless communications

### ASJC Scopus subject areas

- Theoretical Computer Science
- Signal Processing
- Information Systems
- Computer Science Applications

## Fingerprint Dive into the research topics of 'Steiner tree problem with minimum number of Steiner points and bounded edge-length'. Together they form a unique fingerprint.

## Cite this

Lin, G. H., & Xue, G. (1999). Steiner tree problem with minimum number of Steiner points and bounded edge-length.

*Information Processing Letters*,*69*(2), 53-57.