Jochen Könemann, R. Ravi. Quasi-polynomial Time Approximation Algorithm for Low-Degree Minimum-Cost Steiner Trees. In Paritosh K. Pandya, Jaikumar Radhakrishnan, editors, FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science, 23rd Conference, Mumbai, India, December 15-17, 2003, Proceedings. Volume 2914 of Lecture Notes in Computer Science, pages 289-301, Springer, 2003. [doi]
Abstract is missing.