𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Approximating the selected-internal Steiner tree

✍ Scribed by Sun-Yuan Hsieh; Shih-Cheng Yang

Book ID
108281337
Publisher
Elsevier Science
Year
2007
Tongue
English
Weight
338 KB
Volume
381
Category
Article
ISSN
0304-3975

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Approximating the Minimum-Degree Steiner
Approximating the Minimum-Degree Steiner Tree to within One of Optimal
✍ M. Furer; B. Raghavachari πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 691 KB

The problem of constructing a spanning tree for a graph \(G=(V, E)\) with \(n\) vertices whose maximal degree is the smallest among all spanning trees of \(G\) is considered. This problem is easily shown to be NP-hard. In the Steiner version of this problem, along with the input graph, a set of dist

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