Sciweavers

Share
MFCS
2001
Springer

On the Approximability of the Steiner Tree Problem

9 years 5 months ago
On the Approximability of the Steiner Tree Problem
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 satisfiability of linear equation modulo 2. The improvement on the nonapproximability ratio is mainly based on the fact that our reduction does not use variable gadgets. This idea was introduced by Papadimitriou and Vempala. Key words: Minimum Steiner tree, Approximability, Gadget reduction, Lower bounds.
Martin Thimm
Added 30 Jul 2010
Updated 30 Jul 2010
Type Conference
Year 2001
Where MFCS
Authors Martin Thimm
Comments (0)
books