Generating Randomized Roundings with Cardinality Constraints and Derandomizations

DOI10.1007/11672142_47MaRDI QIDQ5449831zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Randomized Rounding in the Presence of a Cardinality Constraint
• Randomized rounding in the presence of a cardinality constraint
• Randomly Rounding Rationals with Cardinality Constraints and Derandomizations
• Dependent Randomized Rounding: The Bipartite Case
• STACS 2005

Cited in

(12)

• Approximability of the robust representatives selection problem
• Improved approximation algorithms for the Min-Max selecting items problem
• Bracketing numbers for axis-parallel boxes and applications to geometric discrepancy
• Randomized rounding in the presence of a cardinality constraint
• Controlled Randomized Rounding
• Component-by-component construction of low-discrepancy point sets of small size
• Randomized rounding for routing and covering problems: experiments and improvements
• Randomly Rounding Rationals with Cardinality Constraints and Derandomizations
• Randomized Rounding in the Presence of a Cardinality Constraint
• Calculation of discrepancy measures and applications
• Entropy, Randomization, Derandomization, and Discrepancy
• Algorithmic construction of low-discrepancy point sets via dependent randomized rounding

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

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