Experimental Study of Non-oblivious Greedy and Randomized Rounding Algorithms for Hypergraph b-Matching.

Tools

Kliemann, Lasse and Srivastav, Anand (2009) Experimental Study of Non-oblivious Greedy and Randomized Rounding Algorithms for Hypergraph b-Matching. In: Experimental Algorithms. ; 5526 . Springer, Berlin, Heidelberg, pp. 185-196. DOI 10.1007/978-3-642-02011-7_18.

Full text not available from this repository.

Supplementary data:

Document Type: Book chapter
Research affiliation: Kiel University > Kiel Marine Science
OceanRep > The Future Ocean - Cluster of Excellence
Kiel University
Refereed: Yes
Publisher: Springer
Projects: Future Ocean
Date Deposited: 29 Mar 2018 10:40
Last Modified: 29 Mar 2018 10:40
URI: https://oceanrep.geomar.de/id/eprint/42534

Actions (login required)

View Item View Item