Construct · 1 fields · 1 citations

randomized rounding: a standalone construct

One name. One construct. A landmark on the map.

● anchor · a standalone construct Nearest construct by meaning·not indexed
randomizedrounding1 CONSTRUCTRandomized roundingRAGHAVAN · APPROXIMATION

A single standalone construct; nearby constructs are located against it in the Collider. Tap a field for its definition, unit, and measures.

Approximation algorithms

turning a fractional linear-programming solution into an integer one by setting variables at random with probabilities given by their fractional values.

In approximation algorithms, randomized rounding refers to turning a fractional linear-programming solution into an integer one by setting variables at random with probabilities given by their fractional values. This meaning comes from Raghavan (1987) in Combinatorica.[1]

Unit
Recovery means
Measured by

Next

Run it through the Collider, or take the citations with you.

See how randomized rounding sits against neighbouring constructs in the Collider, or export every reference on this page in one click.

Open in ColliderExport BibTeXReport this entry

Nearby constructs

solution3 fields · 4 citationsjingle · one word, three constructs

References

  1. Raghavan, P., & Tompson, C. D. (1987). Randomized rounding: A technique for provably good algorithms and algorithmic proofs. Combinatorica, 7(4), 365-374. https://doi.org/10.1007/bf02579324

Cited on this page?

Confirm your construct, or correct us.

If your work is cited behind one of these entries, you know better than we do whether we captured the meaning right. Confirm it, suggest an edit, or dispute it, and your name goes on the entry as an author who has checked it, linked to your ORCID.

Claim your construct