Combinatorial randomized rounding: Boosting randomized rounding with combinatorial arguments

MaRDI QIDQ2752028zbMATH OpenFDO

Authors Pavlos S. Efraimidis, P. G. Spirakis

Publication date 12 May 2002

zbMATH Keywords

combinatorial optimizationcombinatorial randomized roundingscheduling unrelated machines

Mathematics Subject Classification ID

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

Recommendations

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

Cited in

(3)

• A parametric approach for dealing with compositional rounded zeros
• Randomized rounding in the presence of a cardinality constraint
• 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)