
Search the dblp DataBase
Tobias Polzin:
[Publications]
[Author Rank by year]
[Coauthors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
 Tobias Polzin, Siavash Vahdati Daneshmand
Primaldual approaches to the Steiner problem. [Citation Graph (0, 0)][DBLP] APPROX, 2000, pp:214225 [Conf]
 Tobias Polzin, Siavash Vahdati Daneshmand
Extending Reduction Techniques for the Steiner Tree Problem. [Citation Graph (0, 0)][DBLP] ESA, 2002, pp:795807 [Conf]
 Ernst Althaus, Tobias Polzin, Siavash Vahdati Daneshmand
Improving Linear Programming Approaches for the Steiner Tree Problem. [Citation Graph (0, 0)][DBLP] WEA, 2003, pp:114 [Conf]
 Tobias Polzin, Siavash Vahdati Daneshmand
Practical PartitioningBased Methods for the Steiner Problem. [Citation Graph (0, 0)][DBLP] WEA, 2006, pp:241252 [Conf]
 Tobias Polzin, Siavash Vahdati Daneshmand
A comparison of Steiner tree relaxations. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2001, v:112, n:13, pp:241261 [Journal]
 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:13, pp:263300 [Journal]
 Tobias Polzin, Siavash Vahdati Daneshmand
PrimalDual Approaches to the Steiner Problem [Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2000, v:7, n:47, pp: [Journal]
 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:1220 [Journal]
Approaches to the Steiner Problem in Networks. [Citation Graph (, )][DBLP]
Search in 0.209secs, Finished in 0.209secs
