Generating Randomized Roundings with Cardinality Constraints and Derandomizations

DOI10.1007/11672142_47zbMath1136.90405OpenAlexW1488521304MaRDI QIDQ5449831

Benjamin Doerr

Publication date: 19 March 2008

Published in: STACS 2006 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11672142_47

Mathematics Subject Classification ID

Integer programming (90C10) Combinatorial optimization (90C27) Randomized algorithms (68W20)

Related Items (9)

Entropy, Randomization, Derandomization, and Discrepancy ⋮ Component-by-component construction of low-discrepancy point sets of small size ⋮ Improved approximation algorithms for the Min-Max selecting items problem ⋮ Bracketing numbers for axis-parallel boxes and applications to geometric discrepancy ⋮ Algorithmic construction of low-discrepancy point sets via dependent randomized rounding ⋮ Approximability of the robust representatives selection problem ⋮ Randomized Rounding in the Presence of a Cardinality Constraint ⋮ Controlled Randomized Rounding ⋮ Calculation of Discrepancy Measures and Applications

This page was built for publication: Generating Randomized Roundings with Cardinality Constraints and Derandomizations