Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

12

MFCS
2001
Springer

favoriteEmaildiscussreport

130views Theoretical Computer Science» more MFCS 2001»

On the Approximability of the Steiner Tree Problem

13 years 9 months ago

On the Approximability of the Steiner Tree Problem

Download www.matheon.de

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 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

Real-time Traffic

Lower Bounds | MFCS 2001 | Minimum Steiner Tree | Steiner Tree Problem | Theoretical Computer Science |

claim paper

Related Content

» Approximate Maximum Parsimony and Ancestral Maximum Likelihood

» A PTAS for NodeWeighted Steiner Tree in Unit Disk Graphs

» Algorithms for Terminal Steiner Trees

» Improved Approximation Algorithms for the Quality of Service Multicast Tree Problem

» Terminal Steiner Tree with Bounded Edge Length

» A Near Linear Time Approximation Scheme for Steiner Tree Among Obstacles in the Plane

» Lower bounds for the relative greedy algorithm for approximating Steiner trees

» A PartitionBased Relaxation For Steiner Trees

» Approximation Schemes for NodeWeighted Geometric Steiner Tree Problems

Post Info
More Details (n/a)

Added	30 Jul 2010
Updated	30 Jul 2010
Type	Conference
Year	2001
Where	MFCS
Authors	Martin Thimm

Comments (0)