Generating Randomized Roundings with Cardinality Constraints and Derandomizations - researchr publication related

researchr

You are not signed in
Sign in
Sign up

Benjamin Doerr. Generating Randomized Roundings with Cardinality Constraints and Derandomizations. In Bruno Durand, Wolfgang Thomas, editors, STACS 2006, 23rd Annual Symposium on Theoretical Aspects of Computer Science, Marseille, France, February 23-25, 2006, Proceedings. Volume 3884 of Lecture Notes in Computer Science, pages 571-583, Springer, 2006. [doi]

The following publications are possibly variants of this publication:

Randomly Rounding Rationals with Cardinality Constraints and DerandomizationsBenjamin Doerr. STACS 2007: 441-452 [doi]

Randomized Rounding in the Presence of a Cardinality ConstraintBenjamin Doerr, Magnus Wahlström. alenex 2009: 162-174 [doi]

Randomized Rounding in the Presence of a Cardinality ConstraintBenjamin Doerr, Magnus Wahlström. jea, 19(1), 2014. [doi]

How to Generate Randomized Roundings with Dependencies and How to Derandomize ThemBenjamin Doerr, Magnus Wahlström. In Lasse Kliemann, Peter Sanders, editors, Algorithm Engineering - Selected Results and Surveys. Volume 9220 of Lecture Notes in Computer Science, pages 159-184, 2016. [doi]

runs on WebDSL