𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The role of Steiner hulls in the solution to Steiner tree problems

✍ Scribed by J. Scott Provan

Book ID
112684788
Publisher
Springer US
Year
1991
Tongue
English
Weight
811 KB
Volume
33
Category
Article
ISSN
0254-5330

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The Steiner Tree Problem in Orientation
The Steiner Tree Problem in Orientation Metrics
✍ G.Y. Yan; A. Albrecht; G.H.F. Young; C.K. Wong πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 431 KB

Given a set 3 of : i (i=1, 2, ..., k) orientations (angles) in the plane, one can define a distance function which induces a metric in the plane, called the orientation metric [3]. In the special case where all the angles are equal, we call the metric a uniform orientation metric [2]. Specifically,

On the approximability of the Steiner tr
On the approximability of the Steiner tree problem
✍ Martin Thimm πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 165 KB

We show that it is not possible to approximate the minimum Steiner tree problem within 1 + 1 162 unless RP = NP. The currently best known lower bound is 1 + 1 400 . The reduction is from H astad's nonapproximability result for maximum satisΓΏability of linear equation modulo 2. The improvement on the

Variations of the prize-collecting Stein
Variations of the prize-collecting Steiner tree problem
✍ Olena Chapovska; Abraham P. Punnen πŸ“‚ Article πŸ“… 2006 πŸ› John Wiley and Sons 🌐 English βš– 136 KB

## Abstract The prize‐collecting Steiner tree problem is well known to be NP‐hard. We consider seven variations of this problem generalizing several well‐studied bottleneck and minsum problems with feasible solutions as trees of a graph. Four of these problems are shown to be solvable in __O__(__m_