Tobias Polzin

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

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

2000
2001
2002
2003
2004
2005
2006
2007
2008
2009
0
1
2
3
4
1
2
1
1
1
1
1
1

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2009
Approaches to the Steiner Problem in Networks.
Proceedings of the Algorithmics of Large and Complex Networks - Design, 2009

2006
Practical Partitioning-Based Methods for the Steiner Problem.
Proceedings of the Experimental Algorithms, 5th International Workshop, 2006

2003
Algorithms for the Steiner problem in networks.
PhD thesis, 2003

On Steiner trees and minimum spanning trees in hypergraphs.
Oper. Res. Lett., 2003

Improving Linear Programming Approaches for the Steiner Tree Problem.
Proceedings of the Experimental and Efficient Algorithms, Second International Workshop, 2003

2002
Extending Reduction Techniques for the Steiner Tree Problem.
Proceedings of the Algorithms, 2002

2001
Improved algorithms for the Steiner problem in networks.
Discret. Appl. Math., 2001

A comparison of Steiner tree relaxations.
Discret. Appl. Math., 2001

2000
Primal-Dual Approaches to the Steiner Problem
Electron. Colloquium Comput. Complex., 2000


  Loading...