Abstract
We show that it is not possible to approximate the minimum Steiner tree problem within 1+1162 unless RP=NP. The currently best known lower bound is 1+1400. The reduction is from Håstad's nonapproximability result for maximum satisfiability of linear equation modulo2. 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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
