Randomized Rounding in the Presence of a Cardinality Constraint

DOI10.1137/1.9781611972894.16MaRDI QIDQ5233576zbMATH OpenOpenAlexFDO

Authors Benjamin Doerr, Magnus Wahlström

Publication date 11 September 2019

Published in 2009 Proceedings of the Eleventh Workshop on Algorithm Engineering and Experiments (ALENEX) (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/1.9781611972894.16

Mathematics Subject Classification ID

Randomized algorithms (68W20) Approximation algorithms (68W25)

Recommendations

• Randomized rounding in the presence of a cardinality constraint
• Generating Randomized Roundings with Cardinality Constraints and Derandomizations
• Randomly Rounding Rationals with Cardinality Constraints and Derandomizations
• On a generalization of iterated and randomized rounding
• On dependent randomized rounding algorithms
• scientific article; zbMATH DE number 910872
• Randomized rounding: A technique for provably good algorithms and algorithmic proofs
• Combinatorial randomized rounding: Boosting randomized rounding with combinatorial arguments
• scientific article; zbMATH DE number 1405893

Cited in

(10)

• Improved approximation algorithms for the Min-Max selecting items problem
• Randomized rounding in the presence of a cardinality constraint
• Randomized rounding for routing and covering problems: experiments and improvements
• Randomly Rounding Rationals with Cardinality Constraints and Derandomizations
• Dependent Randomized Rounding: The Bipartite Case
• Calculation of discrepancy measures and applications
• Entropy, Randomization, Derandomization, and Discrepancy
• Generating Randomized Roundings with Cardinality Constraints and Derandomizations
• STACS 2005
• Algorithmic construction of low-discrepancy point sets via dependent randomized rounding

This page was built for publication: Randomized Rounding in the Presence of a Cardinality Constraint

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5233576)