Combinatorial randomized rounding: Boosting randomized rounding with combinatorial arguments

zbMATH Open0984.90036MaRDI QIDQ2752028FDOQ2752028

Authors: Pavlos S. Efraimidis, P. G. Spirakis 

Publication date: 12 May 2002

Recommendations

• scientific article; zbMATH DE number 2077129
• On dependent randomized rounding algorithms
• Publication:4938889
• On a generalization of iterated and randomized rounding
• scientific article; zbMATH DE number 780783

zbMATH Keywords

combinatorial optimizationscheduling unrelated machinescombinatorial randomized rounding

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Cited In (3)

• Randomized Rounding in the Presence of a Cardinality Constraint
• A parametric approach for dealing with compositional rounded zeros
• Randomized rounding in the presence of a cardinality constraint

This page was built for publication: Combinatorial randomized rounding: Boosting randomized rounding with combinatorial arguments

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