The steiner problem with edge lengths 1 and 2,
Information Processing Letters
Combinatorial algorithms for integrated circuit layout
Combinatorial algorithms for integrated circuit layout
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
Improved bounds for the online steiner tree problem in graphs of bounded edge-asymmetry
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
The Steiner tree problem on graphs: Inapproximability results
Theoretical Computer Science
Approximation schemes for steiner forest on planar graphs and graphs of bounded treewidth
Proceedings of the forty-second ACM symposium on Theory of computing
Approximation Schemes for Steiner Forest on Planar Graphs and Graphs of Bounded Treewidth
Journal of the ACM (JACM)
The node-weighted steiner problem in graphs of restricted node weights
SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
On fair and optimal multi-source IP-multicast
Computer Networks: The International Journal of Computer and Telecommunications Networking
A Survey of Parallel and Distributed Algorithms for the Steiner Tree Problem
International Journal of Parallel Programming
| Hi-index | 0.00 |
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 Hastad'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.