The steiner problem with edge lengths 1 and 2,
Information Processing Letters
Improved approximations for the Steiner tree problem
SODA selected papers from the third annual ACM-SIAM symposium on Discrete algorithms
Some optimal inapproximability results
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
A 1.598 approximation algorithm for the Steiner problem in graphs
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
On the approximability of the traveling salesman problem (extended abstract)
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Improved Steiner tree approximation in graphs
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
A new approximation algorithm for the Steiner tree problem with performance ratio 5/3
Journal of Algorithms
Polynomial time approximation schemes for Euclidean TSP and other geometric problems
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Proof verification and hardness of approximation problems
SFCS '92 Proceedings of the 33rd Annual Symposium on Foundations of Computer Science
Approximation Hardness of the Steiner Tree Problem on Graphs
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
ACM Transactions on Multimedia Computing, Communications, and Applications (TOMCCAP)
Strategyproof mechanisms for content delivery via layered multicast
NETWORKING'11 Proceedings of the 10th international IFIP TC 6 conference on Networking - Volume Part II
An efficient polynomial-time approximation scheme for Steiner forest in planar graphs
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
How well can primal-dual and local-ratio algorithms perform?
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Algorithms for stochastic optimization of multicast content delivery with network coding
ACM Transactions on Multimedia Computing, Communications, and Applications (TOMCCAP)
| Hi-index | 0.00 |
We show that it is not possible to approximate the minimum Steiner tree problem within 136/135 unless co-RP = NP. This improves the currently best known lower bound by about a factor of 3. The reduction is from Håstad'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.