Randomized Rounding in the Presence of a Cardinality Constraint

DOI10.1137/1.9781611972894.16zbMath1430.68440OpenAlexW2177669448MaRDI QIDQ5233576

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

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

Related Items (5)

Entropy, Randomization, Derandomization, and Discrepancy ⋮ Improved approximation algorithms for the Min-Max selecting items problem ⋮ Algorithmic construction of low-discrepancy point sets via dependent randomized rounding ⋮ Randomized Rounding in the Presence of a Cardinality Constraint ⋮ Calculation of Discrepancy Measures and Applications

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