Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Tobias Polzin
2000 – 2009
- 2009
[c5]Tobias Polzin, Siavash Vahdati Daneshmand: Approaches to the Steiner Problem in Networks. Algorithmics of Large and Complex Networks 2009: 81-103- 2006
- [c4]Tobias Polzin, Siavash Vahdati Daneshmand: Practical Partitioning-Based Methods for the Steiner Problem. WEA 2006: 241-252
- 2004
- [b1]
- 2003
- [j3]Tobias Polzin, Siavash Vahdati Daneshmand: On Steiner trees and minimum spanning trees in hypergraphs. Oper. Res. Lett. 31(1): 12-20 (2003)
- [c3]Ernst Althaus, Tobias Polzin, Siavash Vahdati Daneshmand: Improving Linear Programming Approaches for the Steiner Tree Problem. WEA 2003: 1-14
- 2002
- [c2]Tobias Polzin, Siavash Vahdati Daneshmand: Extending Reduction Techniques for the Steiner Tree Problem. ESA 2002: 795-807
- 2001
- [j2]Tobias Polzin, Siavash Vahdati Daneshmand: A comparison of Steiner tree relaxations. Discrete Applied Mathematics 112(1-3): 241-261 (2001)
- [j1]Tobias Polzin, Siavash Vahdati Daneshmand: Improved algorithms for the Steiner problem in networks. Discrete Applied Mathematics 112(1-3): 263-300 (2001)
- 2000
- [c1]Tobias Polzin, Siavash Vahdati Daneshmand: Primal-dual approaches to the Steiner problem. APPROX 2000: 214-225
- [i1]Tobias Polzin, Siavash Vahdati Daneshmand: Primal-Dual Approaches to the Steiner Problem. Electronic Colloquium on Computational Complexity (ECCC) 7(47) (2000)
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2012-12-02 21:46 CET by the dblp team