Repository: Freie Universität Berlin, Math Department

Approximating Minimum Spanning Sets in Hypergraphs and Polymatroids

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.

Full text not available from this repository.

Item Type:Monograph (Technical Report)
Additional Information:This paper was already accepted for ICALP 2000 but we did not present it since later we were informed that the main result had already been proven in a different way.
Uncontrolled Keywords:Hypergraphs, set systems, and designs, Steiner trees, Approximation algorithms, Colouring, packing and covering, Combinatorial optimization, Graph algorithms
Subjects:Mathematical and Computer Sciences > Computer Science
Divisions:Department of Mathematics and Computer Science > Institute of Computer Science > Algorithmic Bioinformatics Group
ID Code:329
Deposited By: Admin Administrator
Deposited On:14 Apr 2009 14:41
Last Modified:14 Apr 2009 14:41

Repository Staff Only: item control page