Search the dblp DataBase

Publications of Author

1. Tobias Polzin, Siavash Vahdati Daneshmand
   Primal-dual approaches to the Steiner problem. [Citation Graph (0, 0)][DBLP]
   APPROX, 2000, pp:214-225 [Conf]
   
2. Tobias Polzin, Siavash Vahdati Daneshmand
   Extending Reduction Techniques for the Steiner Tree Problem. [Citation Graph (0, 0)][DBLP]
   ESA, 2002, pp:795-807 [Conf]
   
3. Ernst Althaus, Tobias Polzin, Siavash Vahdati Daneshmand
   Improving Linear Programming Approaches for the Steiner Tree Problem. [Citation Graph (0, 0)][DBLP]
   WEA, 2003, pp:1-14 [Conf]
   
4. Tobias Polzin, Siavash Vahdati Daneshmand
   Practical Partitioning-Based Methods for the Steiner Problem. [Citation Graph (0, 0)][DBLP]
   WEA, 2006, pp:241-252 [Conf]
   
5. Tobias Polzin, Siavash Vahdati Daneshmand
   A comparison of Steiner tree relaxations. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2001, v:112, n:1-3, pp:241-261 [Journal]
   
6. Tobias Polzin, Siavash Vahdati Daneshmand
   Improved algorithms for the Steiner problem in networks. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2001, v:112, n:1-3, pp:263-300 [Journal]
   
7. Tobias Polzin, Siavash Vahdati Daneshmand
   Primal-Dual Approaches to the Steiner Problem [Citation Graph (0, 0)][DBLP]
   Electronic Colloquium on Computational Complexity (ECCC), 2000, v:7, n:47, pp:- [Journal]
   
8. Tobias Polzin, Siavash Vahdati Daneshmand
   On Steiner trees and minimum spanning trees in hypergraphs. [Citation Graph (0, 0)][DBLP]
   Oper. Res. Lett., 2003, v:31, n:1, pp:12-20 [Journal]
   
9. 
   Approaches to the Steiner Problem in Networks. [Citation Graph (, )][DBLP]