加载中…
2008-10-10
1.25 Approximation Algorithm for the Steiner Tree Problem with Distances One and Two
Piotr BermanMarek KarpinskiAlex Zelikovsky
文献摘要
We give a 1.25 approximation algorithm for the Steiner Tree Problem with distances one and two, improving on the best known bound for that problem.
讨论
0讲解博客
生成讲解博客的中文版本
AI智能校验
生成AI智能校验的中文版本