Your search returned the following 6 documents:

6. Improving Linear Programming Approaches for the Steiner Tree Problem
   Ernst Althaus, Tobias Polzin, and Siavash Vahdati Daneshmand
   In: Experimental and efficient algorithms : Second International Workshop, WEA 2003, Ascona, Switzerland, May, 26 - May, 28, 2003, 1-14. Note: Pages are not yet known
   
5. On Steiner trees and minimum spanning trees in hypergraphs
   Tobias Polzin and Siavash Vahdati Daneshmand
   Operations Research Letters 31 (1): 12-20, 2003
   
4. Extending Reduction Techniques for the Steiner Tree Problem
   Tobias Polzin and Siavash Vahdati Daneshmand
   In: Algorithms - ESA 2002 : 10th Annual European Symposium, Rom, Italy, 2002, 795-807
   
3. Primal-Dual Approaches to the Steiner Problem
   Tobias Polzin and Siavash Vahdati Daneshmand
   In: Approximation Algorithms for Combinatorial Optimization, Saarbrücken, Germany, September 2000, 2000, 214-225
   
2. A Comparison of Steiner Tree Relaxations
   Tobias Polzin and Siavash Vahdati Daneshmand
   Discrete Applied Mathematics 112: 241-261, 2001
   
1. Improved Algorithms for the Steiner Problem in Networks
   Tobias Polzin and Siavash Vahdati Daneshmand
   Discrete Applied Mathematics 112: 263-300, 2001