Repository: Freie Universität Berlin, Math Department

Browse by Authors

Up a level
Export as [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0
Group by: Date | Item Type
Jump to: 2003 | 2002 | 2001 | 2000
Number of items: 6.

2003

Frömmel, C. and Gille, Ch. and Goede, A. and Gröpl, C. and Hougardy, S. and Nierhoff, T. and Preissner, R. and Thimm, M. (2003) Accelerating screening of 3D protein data with a graph theoretical approach. Bioinformatics, 19 (18). pp. 2442-2447.

2002

Gröpl, C. and Hougardy, S. and Nierhoff, T. and Prömel, H.-J. and Thimm, M. (2002) Approximationsalgorithmen für das Steinerbaumproblem in Graphen. UNSPECIFIED.

Gröpl, C. and Hougardy, S. and Nierhoff, T. and Prömel, H.-J. (2002) Steiner trees in uniformly quasi-bipartite graphs. Information Processing Letters, 83 . pp. 195-200.

2001

Gröpl, C. and Hougardy, S. and Nierhoff, T. and Prömel, H.-J. (2001) Approximation Algorithms for the Steiner Tree Problem in Graphs. In: Steiner Trees in Industry. Kluwer Academic Publishers, pp. 235-279.

Gröpl, C. and Hougardy, S. and Nierhoff, T. and Prömel, H.-J. (2001) Lower bounds for approximation algorithms for the Steiner tree problem. In: Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science (2001).

2000

Baudis, G. and Gröpl, C. and Hougardy, S. and Nierhoff, T. and Prömel, H.-J. (2000) Approximating Minimum Spanning Sets in Hypergraphs and Polymatroids. Technical Report. UNSPECIFIED.

This list was generated on Fri Mar 29 00:18:55 2024 CET.