𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A tight worst case bound for the performance ratio of heuristics for the minimum rectilinear steiner tree problem

✍ Scribed by C. C. De Souza; C. C. Ribeiro

Publisher
Springer
Year
1990
Tongue
German
Weight
234 KB
Volume
12
Category
Article
ISSN
0171-6468

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Worst-case behavior of the MVCA heuristi
Worst-case behavior of the MVCA heuristic for the minimum labeling spanning tree problem
✍ Yupei Xiong; Bruce Golden; Edward Wasil πŸ“‚ Article πŸ“… 2005 πŸ› Elsevier Science 🌐 English βš– 185 KB

In this paper, we review recent work on the minimum labeling spanning tree problem and obtain a new worst-case ratio for the MVCA heuristic. We also present a family of graphs in which the worst-case ratio can be attained. This implies that the new ratio cannot be improved any further.

The Steiner tree problem for terminals o
The Steiner tree problem for terminals on the boundary of a rectilinear polygon
✍ Siu-Wing Cheng πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 233 KB

Given a simple rectilinear polygon P with k sides and n terminals on its boundary, we present an O(k 3 n)-time algorithm to compute the minimal rectilinear Steiner tree lying inside P interconnecting the terminals. We obtain our result by proving structural properties of a selective set of minimal S

A New Approximation Algorithm for the St
A New Approximation Algorithm for the Steiner Tree Problem with Performance Ratio 5/3
✍ Hans JΓΌrgen PrΓΆmel; Angelika Steger πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 100 KB

In this paper we present an RNC approximation algorithm for the Steiner tree problem in graphs with performance ratio 5r3 and RNC approximation algorithms for the Steiner tree problem in networks with performance ratio 5r3 q β‘€ for all β‘€ ) 0. This is achieved by considering a related problem, the min