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: 2004 | 2002 | 2001 | 2000 | 1998
Number of items: 9.

2004

Gröpl, C. and Prömel, H.-J. and Srivastav, A. (2004) Ordered binary decision diagrams and the Shannon effect. Discrete Applied Mathematics, 142 . pp. 67-85.

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

Gröpl, C. and Prömel, H.-J. and Srivastav, A. (2001) On the Evolution of the Worst-Case OBDD Size. Information Processing Letters, 77 . pp. 1-7.

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.

1998

Gröpl, C. and Skutella, M. (1998) Parallel Repetition of MIP(2,1) Systems. In: Lectures on Proof Verification and Approximation Algorithms. Lecture Notes in Computer Science, 1367 . Springer, pp. 161-177.

Gröpl, C. and Prömel, H.-J. and Srivastav, A. (1998) Size and Structure of Random Ordered Binary Decision Diagrams (Extended Abstract). In: STACS 98.

This list was generated on Sun Dec 16 08:13:39 2018 CET.