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
Number of items: 6.

Article

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.

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.

Book Section

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.

Monograph

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.

Conference or Workshop Item

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).

Other

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.

This list was generated on Tue Jun 25 19:10:55 2019 CEST.