Tobias Polzin

According to our database, Tobias Polzin authored at least 9 papers between 2000 and 2009.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2009

Approaches to the Steiner Problem in Networks.

Tobias Polzin, Siavash Vahdati Daneshmand

Proceedings of the Algorithmics of Large and Complex Networks - Design, 2009

2006

Practical Partitioning-Based Methods for the Steiner Problem.

Tobias Polzin, Siavash Vahdati Daneshmand

Proceedings of the Experimental Algorithms, 5th International Workshop, 2006

2003

Algorithms for the Steiner problem in networks.

Tobias Polzin

PhD thesis, 2003

On Steiner trees and minimum spanning trees in hypergraphs.

Tobias Polzin, Siavash Vahdati Daneshmand

Oper. Res. Lett., 2003

Improving Linear Programming Approaches for the Steiner Tree Problem.

Ernst Althaus, Tobias Polzin, Siavash Vahdati Daneshmand

Proceedings of the Experimental and Efficient Algorithms, Second International Workshop, 2003

2002

Extending Reduction Techniques for the Steiner Tree Problem.

Tobias Polzin, Siavash Vahdati Daneshmand

Proceedings of the Algorithms, 2002

2001

Improved algorithms for the Steiner problem in networks.

Tobias Polzin, Siavash Vahdati Daneshmand

Discret. Appl. Math., 2001

A comparison of Steiner tree relaxations.

Tobias Polzin, Siavash Vahdati Daneshmand

Discret. Appl. Math., 2001

2000

Primal-Dual Approaches to the Steiner Problem

Tobias Polzin, Siavash Vahdati Daneshmand

Electron. Colloquium Comput. Complex., 2000