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